Brooks' theorem with forbidden colors

DOI10.1002/jgt.23039arXiv2303.06917OpenAlexW4387576113MaRDI QIDQ6144912

Carl Johan Casselgren

Publication date: 30 January 2024

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

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

zbMATH Keywords

graph coloringlist coloringBrooks' theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• On avoiding some families of arrays
• Precoloring extension for 2-connected graphs with maximum degree three
• A note on Latin squares with restricted support
• You can't paint yourself into a corner
• Extension from precoloured sets of edges
• A note on graph coloring extensions and list-colorings
• Avoiding and extending partial edge colorings of hypercubes
• A note on \(K^-_{\Delta +1}\)-free precolouring with \(\Delta\) colours
• Restricted extension of sparse partial edge colorings of complete graphs
• Brooks' Theorem and Beyond
• Precoloring Extensions of Brooks' Theorem
• Precoloring Extension for 2‐connected Graphs

This page was built for publication: Brooks' theorem with forbidden colors