Some sufficient conditions for a planar graph of maximum degree six to be Class 1

DOI10.1016/J.DISC.2006.03.032zbMath1095.05014OpenAlexW2030707025MaRDI QIDQ2497482

Yuehua Bu, Wei Fan Wang

Publication date: 4 August 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.032

zbMATH Keywords

edge coloringchromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (18)

A sufficient condition for edge 6-colorable planar graphs with maximum degree 6 ⋮ Face-degree bounds for planar critical graphs ⋮ Edge coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Class I graphs of nonnegative characteristic without special cycles ⋮ Edge coloring of planar graphs which any two short cycles are adjacent at most once ⋮ Edge colorings of planar graphs without 5-cycles with two chords ⋮ Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable ⋮ On edge colorings of 1-planar graphs without adjacent triangles ⋮ A survey on the cyclic coloring and its relaxations ⋮ On edge colorings of 1-planar graphs without 5-cycles with two chords ⋮ A sufficient condition for a planar graph to be class I ⋮ Facial rainbow edge-coloring of simple 3-connected plane graphs ⋮ Some sufficient conditions for 1-planar graphs to be class 1 ⋮ Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable ⋮ An introduction to the discharging method via graph coloring ⋮ Edge colorings of planar graphs without 6-cycles with three chords ⋮ Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles ⋮ Edge-partition and star chromatic index

Cites Work

• Unnamed Item
• Unnamed Item
• Planar graphs without cycles of specific lengths
• Some 4-valent, 3-connected, planar, almost pancyclic graphs
• Coloring edges of graphs embedded in a surface of characteristic zero.
• Choosability and edge choosability of planar graphs without five cycles
• Planar graphs of maximum degree seven are Class I
• A note on graphs of class I
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: Some sufficient conditions for a planar graph of maximum degree six to be Class 1