On total colorings of 1-planar graphs

DOI10.1007/s10878-013-9641-9zbMath1317.05066arXiv1304.6263OpenAlexW2054273854MaRDI QIDQ2352360

Xin Zhang, Gui Zhen Liu, Jian-Feng Hou

Publication date: 1 July 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.6263

zbMATH Keywords

total coloringdischarging method1-planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles ⋮ An improved upper bound on the linear 2-arboricity of 1-planar graphs ⋮ On total colorings of some special 1-planar graphs ⋮ An annotated bibliography on 1-planarity ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ Total colorings-a survey ⋮ A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five ⋮ A structure of 1-planar graph and its applications to coloring problems ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 ⋮ Light structures in 1-planar graphs with an application to linear 2-arboricity ⋮ The linear 2-arboricity of 1-planar graphs without 3-cycles ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On edge colorings of 1-planar graphs without adjacent triangles
• On \((p,1)\)-total labelling of 1-planar graphs
• List edge and list total coloring of 1-planar graphs
• Coloring vertices and faces of locally planar graphs
• The total coloring of a multigraph with maximal degree 4
• The total chromatic number of any multigraph with maximum degree five is at most seven
• On edge colorings of \(1\)-planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• On the total coloring of certain graphs
• (1,λ)-EMBEDDED GRAPHS AND THE ACYCLIC EDGE CHOOSABILITY
• Edge Coloring of Triangle-Free 1-Planar Graphs
• Total Colourings of Graphs
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• A new proof of the 6 color theorem
• Coupled choosability of plane graphs
• On Total Chromatic Number of a Graph
• Acyclic colouring of 1-planar graphs