Entire coloring of graphs embedded in a surface of nonnegative characteristic
type: Item
instance of: scholarly article
title: Entire coloring of graphs embedded in a surface of nonnegative characteristic
zbMATH Open document ID: 1402.05068
author: Xiaoxue Hu
author: Ping Wang
author: Weifan Wang
author: Yiqiao Wang
published in: Graphs and Combinatorics
publication date: 2019-01-11T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 7000704
zbMATH Keywords: embedded graph
zbMATH Keywords: Euler characteristic
zbMATH Keywords: entire coloring
zbMATH Keywords: maximum degree
MaRDI profile type: Publication
full work available at URL: s00373-018-1971-z
OpenAlex ID: W2742306880
cites work: Coloring vertices and faces of locally planar graphs
cites work: Every planar map is four colorable
cites work: Dirac's map-color theorem for choosability
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: Choosability of toroidal graphs without short cycles
cites work: The entire chromatic number of graphs embedded on the torus with large maximum degree
cites work: Graphs of degree 4 are 5-edge-choosable
cites work: Coloring even-faced graphs in the torus and the Klein bottle
cites work: A seven-color theorem on the sphere
cites work: The 4-choosability of toroidal graphs without intersecting triangles
cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
cites work: Q3922702
cites work: Q3818330
cites work: On simultaneous colorings of embedded graphs
cites work: On simultaneous edge-face colorings of plane graphs
cites work: On the Entire Coloring Conjecture
cites work: The edge-face coloring of graphs embedded in a surface of characteristic zero
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: Coupled choosability of plane graphs
cites work: Entire colouring of plane graphs
cites work: Planar Graphs with $\Delta\ge 9$ are Entirely $(\Delta+2)$-Colorable
cites work: Simultaneously colouring the edges and faces of plane graphs
cites work: Total colourings of graphs
DOI: 10.1007/S00373-018-1971-Z
description: scientific article; zbMATH DE number 7000704