Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings

DOI10.1002/jgt.22827zbMath1525.05042arXiv2008.13274OpenAlexW3081847610MaRDI QIDQ6081567

No author found.

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.13274

zbMATH Keywords

treewidthprobabilistic methodacyclic coloringLovász local lemmastar coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Forbidden minors characterization of partial 3-trees
• Ramanujan graphs
• The list chromatic number of graphs with small clique number
• Linear-programming design and analysis of fast algorithms for Max 2-CSP
• On tree width, bramble size, and expansion
• Bounds on vertex colorings with restrictions on the union of color classes
• Star coloring of graphs
• Acyclic coloring of graphs
• Improved Bounds for Centered Colorings
• Acyclic colorings of planar graphs
• Graph colouring and the probabilistic method

This page was built for publication: Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings