On chromatic numbers of two extensions of planar graphs

DOI10.1007/S40306-018-0252-5zbMATH Open1417.05079OpenAlexW2789314875WikidataQ130122254 ScholiaQ130122254MaRDI QIDQ2000818FDOQ2000818

Authors: 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

Recommendations

• Choosability of \(K_5\)-minor-free graphs
• An extension of Thomassen's result on choosability
• Construction of \(K_{n}\)-minor free graphs with given circular chromatic number
• Group chromatic number of graphs without \(K_5\)-minors
• On colorability of graphs with forbidden minors along paths and circuits

zbMATH Keywords

planar graphsacyclic coloringstar coloringcoloring numbercircular choosability

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• On colorability of graphs with forbidden minors along paths and circuits
• Title not available (Why is that?)
• The complete chromatic number of some planar graphs
• Construction of \(K_{n}\)-minor free graphs with given circular chromatic number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000818)