The complete chromatic number of some planar graphs
From MaRDI portal
Publication:1312961
zbMath0788.05048MaRDI QIDQ1312961
Jianfan Wang, Liuxing Wang, Wei Fan Wang, Zhong Fu Zhang
Publication date: 7 February 1994
Published in: Science in China. Series A (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
The entire choosability of plane graphs ⋮ Plane graphs with maximum degree 9 are entirely 11-choosable ⋮ On the complete chromatic number of Halin graphs ⋮ \(D(\beta)\)-vertex-distinguishing total coloring of graphs ⋮ Edge-face total chromatic number of outerplanar graphs with Δ (G)=6 ⋮ Adjacent strong edge colorings and total colorings of regular graphs
