A note on class one graphs with maximum degree six
From MaRDI portal
Publication:2497484
DOI10.1016/J.DISC.2006.02.007zbMATH Open1106.05034OpenAlexW2023340534MaRDI QIDQ2497484FDOQ2497484
Authors: Xuechao Li, Rong Luo, Jianbing Niu 
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.02.007
Recommendations
- Some sufficient conditions 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 new sufficient condition for a planar graph of maximum degree six to be class 1
- On Gallai's conjecture for graphs with maximum degree 6
- scientific article; zbMATH DE number 1135746
- Planar graphs of maximum degree six without 7-cycles are class one
- A note on graphs of class I
- A class of perfect graphs containing \(P_{6}\)
- Classifying character degree graphs with six vertices
- On the domination number of graphs with minimum degree six
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- 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
- On small graphs critical with respect to edge colourings
- Chromatic-index-critical graphs of orders 11 and 12
- Chromatic index critical graphs of order 9
- Edge coloring of graphs with small average degrees
Cited In (10)
- A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
- Every planar graph with maximum degree 7 is of class 1
- Title not available (Why is that?)
- Edge coloring of graphs embedded in a surface of nonnegative characteristic
- Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\)
- Finding \(\Delta(\Sigma)\) for a surface \(\Sigma\) of characteristic \(-4\)
- Class I graphs of nonnegative characteristic without special cycles
- 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
- Classifying character degree graphs with six vertices
This page was built for publication: A note on class one graphs with maximum degree six
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497484)
