On the vertex face total chromatic number of planar graphs

DOI10.1002/(SICI)1097-0118(199605)22:1%3C29::AID-JGT5%3E3.0.CO;2-NzbMATH Open0854.05050OpenAlexW2323330637MaRDI QIDQ4879164FDOQ4879164

Authors: Weifang Wang, Jiazhuangu Liu 

Publication date: 8 July 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199605)22:1%3C29::aid-jgt5%3E3.0.co;2-n

Recommendations

• scientific article; zbMATH DE number 1367494
• The total coloring of planar graphs with a few \(3\)-faces incidents with vertex
• scientific article; zbMATH DE number 1347008
• scientific article; zbMATH DE number 500266

zbMATH Keywords

planar graphouterplanar graphsRingel's conjectureeulerian outerplanar graphsvertex face total chromatic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15)

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Entire colouring of plane graphs
• Title not available (Why is that?)
• The complete chromatic number of some planar graphs
• On the \(d\)-distance face chromatic number of plane graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simultaneous coloring of vertices and incidences of outerplanar graphs
• Coloring vertices and faces of locally planar graphs
• Gaps in the chromatic spectrum of face-constrained plane graphs

This page was built for publication: On the vertex face total chromatic number of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879164)