2 problems

0 votes0 replies1 view
Wu–Xu–Xu conjecture on three-colorability of graphs with one odd-hole length
Wu–Xu–Xu conjecture. Every graph in
Conjectureopengraph-coloring induced-cycles odd-hole-free-graphsarXiv posted 2 days ago
0 votes0 replies0 views
Recolouring conjecture for odd-hole-free graphs
Odd-hole-free recolouring conjecture. All odd-hole-free graphs of maximum degree $\Delta$ and clique number $\omega$ are $k$ -recolourable for
Conjecturerefutedgraph-colouring odd-hole-free-graphs reconfigurationarXiv posted 2 days ago

Wu–Xu–Xu conjecture on three-colorability of graphs with one odd-hole length