The entire chromatic number of graphs embedded on the torus with large maximum degree

DOI10.1016/J.TCS.2017.05.018zbMath1372.05074OpenAlexW2617479596MaRDI QIDQ2402264

Xiaoxue Hu, Ping Wang, Wei Fan Wang, Yi Qiao Wang

Publication date: 7 September 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.05.018

zbMATH Keywords

torusmaximum degreeembedded graphentire coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Optimal \(r\)-dynamic coloring of sparse graphs ⋮ Entire coloring of graphs embedded in a surface of nonnegative characteristic

Cites Work

• Entire colouring of plane graphs
• Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
• On simultaneous colorings of embedded graphs
• A seven-color theorem on the sphere
• On the Entire Coloring Conjecture
• Structural theorem on plane graphs with application to the entire coloring number
• Planar Graphs with $\Delta\ge 9$ are Entirely $(\Delta+2)$-Colorable
• Plane Graphs with Maximum Degree Are Entirely ‐Colorable

This page was built for publication: The entire chromatic number of graphs embedded on the torus with large maximum degree