[HTML][HTML] Strengthening Hadwiger's conjecture for 4-and 5-chromatic graphs
A Martinsson, R Steiner - Journal of Combinatorial Theory, Series B, 2024 - Elsevier
Hadwiger's famous coloring conjecture states that every t-chromatic graph contains a K t-
minor. Holroyd [11] conjectured the following strengthening of Hadwiger's conjecture: If G is …
minor. Holroyd [11] conjectured the following strengthening of Hadwiger's conjecture: If G is …
Kempe chains and rooted minors
M Kriesell, S Mohr - arXiv preprint arXiv:1911.09998, 2019 - arxiv.org
A (minimal) transversal of a partition is a set which contains exactly one element from each
member of the partition and nothing else. A coloring of a graph is a partition of its vertex set …
member of the partition and nothing else. A coloring of a graph is a partition of its vertex set …