Coloring graphs without bichromatic cycles or paths

DOI10.1007/S40840-020-01040-4MaRDI QIDQ2045232zbMATH OpenOpenAlexFDO

Authors Hongguo Zhu, Jianfeng 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

\(P_k\)-free graphacyclic graphcoloringentropy compression

Mathematics Subject Classification ID

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

Recommendations

• Acyclic coloring of graphs without bichromatic long path
• Colouring graphs with forbidden bipartite subgraphs
• Colorful paths in vertex coloring of graphs.
• Improved bounds on coloring of graphs
• Properly colored paths and cycles in edge colored graphs

Cites work

• A constructive proof of the general Lovász local lemma
• Acyclic 4-choosability of planar graphs
• Acyclic coloring of graphs
• Acyclic coloring of graphs and entropy compression method
• Acyclic coloring of graphs without bichromatic long path
• Acyclic colorings of planar graphs
• Acyclic edge coloring of planar graphs without 4-cycles
• Acyclic edge-coloring using entropy compression
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• Improved bounds on coloring of graphs
• Improved upper bound for generalized acyclic chromatic number of graphs
• On acyclic colorings of graphs on surfaces
• On acyclic colorings of planar graphs
• Star coloring of graphs
• The \(r\)-acyclic chromatic number of planar graphs

Cited in

(7)

• Coloring squares of planar graphs with maximum degree at most five
• On L (p, q)-labelling of planar graphs without cycles of length four
• scientific article; zbMATH DE number 7141490 (Why is no real title available?)
• Colouring graphs with forbidden bipartite subgraphs
• Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings
• Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length
• Acyclic coloring of graphs without bichromatic long path

This page was built for publication: Coloring graphs without bichromatic cycles or paths

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