Entire coloring of graphs embedded in a surface of nonnegative characteristic
From MaRDI portal
Publication:1756114
DOI10.1007/s00373-018-1971-zzbMath1402.05068OpenAlexW2742306880MaRDI QIDQ1756114
Xiaoxue Hu, Ping Wang, Wei Fan Wang, Yi Qiao Wang
Publication date: 11 January 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-018-1971-z
Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Entire colouring of plane graphs
- The 4-choosability of toroidal graphs without intersecting triangles
- Coloring vertices and faces of locally planar graphs
- Coloring even-faced graphs in the torus and the Klein bottle
- The edge-face coloring of graphs embedded in a surface of characteristic zero
- On simultaneous edge-face colorings of plane graphs
- Simultaneously colouring the edges and faces of plane graphs
- On simultaneous colorings of embedded graphs
- A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs
- The edge-face choosability of plane graphs
- Total colourings of graphs
- The entire chromatic number of graphs embedded on the torus with large maximum degree
- A seven-color theorem on the sphere
- Choosability of toroidal graphs without short cycles
- Every planar map is four colorable
- On the Entire Coloring Conjecture
- Structural theorem on plane graphs with application to the entire coloring number
- Graphs of degree 4 are 5-edge-choosable
- Dirac's map-color theorem for choosability
- A new proof of the 6 color theorem
- Planar Graphs with $\Delta\ge 9$ are Entirely $(\Delta+2)$-Colorable
- Coupled choosability of plane graphs
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Unnamed Item
- Unnamed Item
This page was built for publication: Entire coloring of graphs embedded in a surface of nonnegative characteristic
