A note on graphs of class I
From MaRDI portal
Publication:1869228
DOI10.1016/S0012-365X(02)00793-8zbMath1014.05028MaRDI QIDQ1869228
Publication date: 9 April 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (16)
Strict neighbor-distinguishing total index of graphs ⋮ A sufficient condition for edge 6-colorable planar graphs with maximum degree 6 ⋮ Face-degree bounds for planar critical graphs ⋮ Edge coloring of planar graphs without adjacent 7-cycles ⋮ 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 ⋮ Bounds on directed star arboricity in some digraph classes ⋮ Edge colorings of planar graphs without 5-cycles with two chords ⋮ A survey on the cyclic coloring and its relaxations ⋮ A sufficient condition for a planar graph to be class I ⋮ Facial rainbow edge-coloring of simple 3-connected plane graphs ⋮ Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable ⋮ Edge colorings of planar graphs without 6-cycles with three chords ⋮ 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
This page was built for publication: A note on graphs of class I
