Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
From MaRDI portal
Publication:2859863
zbMATH Open1289.05155MaRDI QIDQ2859863FDOQ2859863
Authors: Guanghui Wang, Jiansheng Cai, Guiying Yan 
Publication date: 19 November 2013
Published in: Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)
Recommendations
- Total coloring of planar graphs with maximum degree 8
- Total colorings of planar graphs with maximum degree at least 8
- Total coloring of planar graphs of maximum degree eight
- Minimum total coloring of planar graphs with maximum degree 8
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
- Total colorings of \(F_5\)-free planar graphs with maximum degree 8
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- Total colorings of planar graphs with large maximum degree
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (7)
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- Total coloring of planar graphs with maximum degree 8
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- Title not available (Why is that?)
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- Total coloring of planar graphs of maximum degree eight
- Minimum total coloring of planar graphs with maximum degree 8
This page was built for publication: Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859863)
