On chromatic numbers of two extensions of planar graphs

DOI10.1007/s40306-018-0252-5zbMath1417.05079OpenAlexW2789314875WikidataQ130122254 ScholiaQ130122254MaRDI QIDQ2000818

Khosro Tajbakhsh

Publication date: 28 June 2019

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40306-018-0252-5

zbMATH Keywords

planar graphscoloring numberacyclic coloringstar coloringcircular choosability

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on group choosability of graphs with girth at least 4
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• On acyclic colorings of planar graphs
• Coloring with no 2-colored \(P_4\)'s
• On group choosability of graphs. II
• Circular choosability via combinatorial Nullstellensatz
• Circular choosability
• Circular choosability of graphs
• On chromatic number of graphs and set-systems
• Acyclic colorings of planar graphs

This page was built for publication: On chromatic numbers of two extensions of planar graphs