A sufficient condition for a planar graph to be class I

DOI10.1016/j.tcs.2007.05.032zbMath1125.68090OpenAlexW1990524577MaRDI QIDQ2456359

Yongzhu Chen, Wei Fan Wang

Publication date: 18 October 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.05.032

zbMATH Keywords

cycleplanar graphchromatic indexedge colouring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (13)

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 ⋮ A survey on the cyclic coloring and its relaxations ⋮ 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 colourings of embedded graphs without 4-cycles or chordal-4-cycles

Cites Work

• Unnamed Item
• Coloring edges of graphs embedded in a surface of characteristic zero.
• Edge coloring of graphs with small average degrees
• Planar graphs of maximum degree seven are Class I
• A note on graphs of class I
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• A note on class one graphs with maximum degree six
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: A sufficient condition for a planar graph to be class I