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

DOI10.1016/J.DISC.2006.03.032zbMATH Open1095.05014OpenAlexW2030707025MaRDI QIDQ2497482FDOQ2497482

Authors: Yuehua Bu, Weifan 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

Recommendations

• A new sufficient condition for a planar graph of maximum degree six to be class 1
• A sufficient condition for a plane graph with maximum degree 6 to be class 1
• A sufficient condition for a planar graph of maximum degree five to be class 1
• scientific article; zbMATH DE number 1439502
• A note on class one graphs with maximum degree six
• A sufficient condition for a planar graph to be of class 1
• A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
• Planar graphs of maximum degree six without 7-cycles are class one
• Some sufficient conditions for 1-planar graphs to be class 1
• A sufficient condition for a planar graph to be class I

zbMATH Keywords

edge coloringchromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (22)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497482)