Acyclic coloring of graphs without bichromatic long path

DOI10.1007/s11464-015-0497-4zbMath1325.05081OpenAlexW2109280440MaRDI QIDQ889416

Shu-Fei Wu, Jian-Feng Hou

Publication date: 6 November 2015

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-015-0497-4

zbMATH Keywords

pathcoloringacyclicentropy compression

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items

Construction of acyclically 4-colourable planar triangulations with minimum degree 4, Acyclic coloring of claw-free graphs with small degree, Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6, Coloring graphs without bichromatic cycles or paths, Acyclic coloring of graphs with maximum degree at most six

Cites Work

• Unnamed Item
• Unnamed Item
• Acyclic 4-choosability of planar graphs
• Note to the paper of Grünbaum on acyclic colorings
• On acyclic colorings of planar graphs
• On acyclic colorings of graphs on surfaces
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable
• Acyclic edge-coloring using entropy compression
• A sufficient condition for planar graphs to be acyclically 5-choosable
• Acyclic and oriented chromatic numbers of graphs
• Star coloring of graphs
• Acyclic 5-choosability of planar graphs without small cycles
• A constructive proof of the general lovász local lemma
• Estimation of sparse hessian matrices and graph coloring problems
• Acyclic coloring of graphs
• Acyclic list 7‐coloring of planar graphs
• The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
• Acyclic colorings of planar graphs
• Acyclic colouring of 1-planar graphs