Mi-Edge Colorings of Graphs
نویسندگان
چکیده
An edge coloring of a graph G is called Mi-edge coloring if at most i colors appear at any vertex of G. Let Ki(G) denote the maximum number of colors used in an Mi-edge coloring of G. In this paper we determine the exact value of K2(G) for any graph G of maximum degree at most 3. Mathematics Subject Classification: 05C15, 05C38
منابع مشابه
M2-edge Colorings of Dense Graphs
An edge coloring φ of a graph G is called an Mi-edge coloring if |φ(v)| ≤ i for every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let Ki(G) denote the maximum number of colors used in an Mi-edge coloring of G. In this paper we establish some bounds of K2(G), present some graphs achieving the bounds and determine exact values of K2(G) for dense graphs.
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملHajj Os Theorem for Colorings of Edge-weighted Graphs
Hajj os theorem states that every graph with chromatic number at least k can be obtained from the complete graph K k by a sequence of simple operations such that every intermediate graph also has chromatic number at least k. Here, Hajj os theorem is extended in three slightly diierent ways to colorings and circular colorings of edge-weighted graphs. These extensions shed some new light on the H...
متن کاملConflict-Free Colorings - Of Graphs and Hypergraphs - Diploma-Thesis of
Conflict-free colorings are known as vertex-colorings of hypergraphs. In such a coloring each hyperedge contains a vertex whose color is not assigned to any other vertex within this edge. In this thesis the notion of conflict-free colorings is translated to edge-colorings of graphs. For graphs G and H a conflict-free coloring of G ensures an edge of unique color in each copy of H in G. The mini...
متن کاملVertex-, edge-, and total-colorings of Sierpinski-like graphs
Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the Sierpiński graphs S(n, k), graphs S (n, k), and graphs S(n, k) are considered. In particular, χ′′(Sn), χ (S(n, k)), χ(S(n, k)), χ(S(n, k)), χ(S(n, k)), and χ(S(n, k)) are determined.
متن کامل