Coloring graphs without bichromatic cycles or paths

DOI10.1007/s40840-020-01040-4zbMath1470.05058OpenAlexW3094628793MaRDI QIDQ2045232

Hongguo Zhu, Jian-Feng Hou

Publication date: 12 August 2021

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-020-01040-4

zbMATH Keywords

coloringacyclic graph\(P_k\)-free graphentropy compression

Mathematics Subject Classification ID

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

Related Items

Coloring squares of planar graphs with maximum degree at most five ⋮ On \(L (p, q)\)-labelling of planar graphs without cycles of length four

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds on coloring of graphs
• Acyclic 4-choosability of planar graphs
• Acyclic coloring of graphs without bichromatic long path
• On acyclic colorings of planar graphs
• Improved upper bound for generalized acyclic chromatic number of graphs
• On acyclic colorings of graphs on surfaces
• Acyclic edge coloring of planar graphs without 4-cycles
• Acyclic coloring of graphs and entropy compression method
• The \(r\)-acyclic chromatic number of planar graphs
• Acyclic edge-coloring using entropy compression
• Star coloring of graphs
• A constructive proof of the general lovász local lemma
• Acyclic coloring of graphs
• Acyclic colorings of planar graphs