Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: dis- charging method.

Sortuj według:

Ogranicz wyniki do:

Strong Edge-Coloring Of Planar Graphs

100%

Song W.-Y., Miao L.-Y.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 4

845-857

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 if G is a planar graph with g ≥ 5, then 𝜒's(G) ≤ 4(G) − 2 when Δ(G) ≥ 6 and 𝜒's(G) ≤ 19 when Δ(G) = 5, where g is the girth of G.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Miao L.-Y.

1 Song W.-Y.

1 2017

Wyniki wyszukiwania

Strong Edge-Coloring Of Planar Graphs