On the vertex face total chromatic number of planar graphs

DOI<29::AID-JGT5>3.0.CO;2-N 10.1002/(SICI)1097-0118(199605)22:1<29::AID-JGT5>3.0.CO;2-NzbMath0854.05050OpenAlexW2323330637MaRDI QIDQ4879164

Jiazhuangu Liu, Weifang Wang

Publication date: 8 July 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199605)22:1<29::aid-jgt5>3.0.co;2-n

zbMATH Keywords

outerplanar graphsplanar graphRingel's conjectureeulerian outerplanar graphsvertex face total chromatic number

Mathematics Subject Classification ID

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

Related Items (4)

Coloring vertices and faces of locally planar graphs ⋮ Simultaneous coloring of vertices and incidences of outerplanar graphs ⋮ Unnamed Item ⋮ Entire colouring of plane graphs

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