A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
DOI10.1016/J.DAM.2022.01.018zbMATH Open1485.05037OpenAlexW4220881176MaRDI QIDQ832998FDOQ832998
Authors: Zhengrong Lu, Lingsheng Shi 
Publication date: 28 March 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.01.018
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
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
- Edge colorings of planar graphs without 6-cycles with three chords
- A note on class one graphs with maximum degree six
Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- 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 sufficient condition for a plane graph with maximum degree 6 to be class 1
- A note on graphs of class I
- A sufficient condition for a planar graph to be class I
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
- Title not available (Why is that?)
- On Tutte's extension of the four-colour problem
- Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)
Cited In (11)
- Structural properties and edge choosability of planar graphs without 6-cycles
- Edge colorings of planar graphs without 6-cycles with three chords
- A new sufficient condition for a planar graph of maximum degree six to be class 1
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
- Every planar graph with maximum degree 7 is of class 1
- Remarks on planar edge-chromatic critical graphs
- A sufficient condition for a plane graph with maximum degree 6 to be class 1
- Total-coloring of sparse graphs with maximum degree 6
- Finding \(\Delta(\Sigma)\) for a surface \(\Sigma\) of characteristic \(-4\)
- 19-linear-colorable graphs with maximum degree 6
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
This page was built for publication: A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832998)
