Július Czap, Peter Šugerek, Jaroslav Ivančo (2016)
Discussiones Mathematicae Graph Theory
Similarity:
An edge coloring φ of a graph G is called an M2-edge coloring if |φ(v)| ≤ 2 for every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let 𝒦2(G) denote the maximum number of colors used in an M2-edge coloring of G. In this paper we determine 𝒦2(G) for trees, cacti, complete multipartite graphs and graph joins.
Ghebleh, Mohammad, Kral', Daniel, Norine, Serguei, Thomas, Robin (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Oleg V. Borodin, Anna O. Ivanova (2013)
Discussiones Mathematicae Graph Theory
Similarity:
We prove that every planar graph with maximum degree ∆ is strong edge (2∆−1)-colorable if its girth is at least 40 [...] +1. The bound 2∆−1 is reached at any graph that has two adjacent vertices of degree ∆.
Juvan, Martin, Mohar, Bojan, Thomas, Robin (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zhou, Xiao, Nishizeki, Takao (1999)
Journal of Graph Algorithms and Applications
Similarity:
LeSaulnier, Timothy D., Stocker, Christopher, Wenger, Paul S., West, Douglas B. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wen-Yao Song, Lian-Ying Miao (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A strong edge-coloring of a graph is a proper edge-coloring where each color class induces a matching. We denote by 𝜒's(G) the strong chromatic index of G which is the smallest integer k such that G can be strongly edge-colored with k colors. It is known that every planar graph G has a strong edge-coloring with at most 4 Δ(G) + 4 colors [R.J. Faudree, A. Gyárfás, R.H. Schelp and Zs. Tuza, The strong chromatic index of graphs, Ars Combin. 29B (1990) 205–211]. In this paper, we show that...
Mohar, Bojan, Pisanski, Tomaz (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt (2016)
Discussiones Mathematicae Graph Theory
Similarity:
Let G = (V,E) be a simple graph and for every edge e ∈ E let L(e) be a set (list) of available colors. The graph G is called L-edge colorable if there is a proper edge coloring c of G with c(e) ∈ L(e) for all e ∈ E. A function f : E → ℕ is called an edge choice function of G and G is said to be f-edge choosable if G is L-edge colorable for every list assignment L with |L(e)| = f(e) for all e ∈ E. Set size(f) = ∑e∈E f(e) and define the sum choice index χ′sc(G) as the minimum of size(f)...
Li, Jinbo, Liu, Guizhen (2011)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Felsner, Stefan, Massow, Mareike (2008)
Journal of Graph Algorithms and Applications
Similarity:
Oleg V. Borodin (1990)
Mathematica Slovaca
Similarity:
Yuehua Bu, Ko-Wei Lih, Weifan Wang (2011)
Discussiones Mathematicae Graph Theory
Similarity:
An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge-coloring o G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by χ'ₐ(G). We prove that χ'ₐ(G) is at most the maximum degree plus 2 if G is a planar graph without isolated edges whose girth is at least 6. This gives new evidence to a conjecture proposed in [Z. Zhang, L. Liu,...