Acyclic coloring of IC-planar graphs

DOI10.1016/j.disc.2019.111623zbMath1422.05046OpenAlexW2964695382WikidataQ127404410 ScholiaQ127404410MaRDI QIDQ2329208

Wanshun Yang, Yi Qiao Wang, Wei Fan Wang

Publication date: 17 October 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.111623

zbMATH Keywords

acyclic chromatic numberacyclic coloring1-planar graphIC-planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

An improved upper bound on the linear 2-arboricity of 1-planar graphs, Acyclic coloring of graphs with maximum degree 7, An improved upper bound for the acyclic chromatic number of 1-planar graphs, The linear 2-arboricity of IC-planar graphs, IC-Planar Graphs Are 6-Choosable, The linear 2-arboricity of 1-planar graphs without 3-cycles

Cites Work

• Unnamed Item
• Note to the paper of Grünbaum on acyclic colorings
• Every planar graph has an acyclic 7-coloring
• On acyclic colorings of planar graphs
• Every planar graph has an acyclic 8-coloring
• Ein Sechsfarbenproblem auf der Kugel
• Coloring plane graphs with independent crossings
• Chromatic number, independence ratio, and crossing number
• Acyclic Colourings of Planar Graphs with Large Girth
• A new proof of the 6 color theorem
• Acyclic colorings of planar graphs
• Acyclic colouring of 1-planar graphs