Entire colouring of plane graphs
type: Item
instance of: scholarly article
title: Entire colouring of plane graphs
zbMATH Open document ID: 1234.05106
author: Xuding Zhu
author: Weifan Wang
published in: Journal of Combinatorial Theory. Series B
publication date: 2011-12-08T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5987725
zbMATH Keywords: entire colouring
zbMATH Keywords: plane graph
zbMATH Keywords: vertex colouring
zbMATH Keywords: edge colouring
zbMATH Keywords: face colouring
MaRDI profile type: Publication
full work available at URL: j.jctb.2011.02.006
OpenAlex ID: W2050917159
cites work: Every planar map is four colorable
cites work: Simultaneous coloring of edges and faces of plane graphs
cites work: Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
cites work: On the total coloring of planar graphs.
cites work: A new proof of the 6 color theorem
cites work: Structural theorem on plane graphs with application to the entire coloring number
cites work: List edge and list total colourings of multigraphs
cites work: Total colorings of planar graphs with large maximum degree
cites work: Q4947393
cites work: Q5615945
cites work: 25 pretty graph colouring problems
cites work: The total chromatic number of any multigraph with maximum degree five is at most seven
cites work: Total-Coloring of Plane Graphs with Maximum Degree Nine
cites work: A seven-color theorem on the sphere
cites work: Q4075398
cites work: On the total coloring of certain graphs
cites work: Ein Sechsfarbenproblem auf der Kugel
cites work: On simultaneous edge-face colorings of plane graphs
cites work: On total 9-coloring planar graphs of maximum degree seven
cites work: On the Entire Coloring Conjecture
cites work: Planar graphs of maximum degree seven are Class I
cites work: On improving the edge-face coloring theorem
cites work: Edge-face coloring of plane graphs with maximum degree nine
cites work: On Total Chromatic Number of a Graph
cites work: Q5564127
cites work: Q5558480
cites work: Simultaneously colouring the edges and faces of plane graphs
cites work: On the vertex face total chromatic number of planar graphs
cites work: Upper bounds of entire chromatic number of plane graphs
cites work: A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs
cites work: The edge-face choosability of plane graphs
cites work: Total chromatic number of planar graphs with maximum degree ten
cites work: Coupled choosability of plane graphs
cites work: Every planar graph with maximum degree 7 is of class 1
DOI: 10.1016/J.JCTB.2011.02.006
description: scientific article; zbMATH DE number 5987725