scientific article; zbMATH DE number 6311321
From MaRDI portal
Publication:4980484
zbMATH Open1299.05124MaRDI QIDQ4980484FDOQ4980484
Authors: Huihui Li, Yingqian Wang 
Publication date: 30 June 2014
Title of this publication is not available (Why is that?)
Recommendations
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
- On total 9-coloring planar graphs of maximum degree seven
- Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
- Every plane graph of maximum degree 8 has an edge-face 9-coloring
- On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles
- Edge-face coloring of plane graphs with maximum degree nine
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4980484)
