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 …
被引用次数：1 相关文章

Kempe Chains and Rooted Minors

M Kriesell, S Mohr - imada.sdu.dk
A (minimal) transversal of a partition is a set which contains exactly one member from each
member of the partition and nothing else. We study the following problem. Given a …

Kempe Chains and Rooted Minors

M Kriesell, S Mohr - arXiv e-prints, 2019 - ui.adsabs.harvard.edu
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 …

Kempe Chains and Rooted Minors

M Kriesell, S Mohr - imada.sdu.dk
A (minimal) transversal of a partition is a set which contains exactly one member from each
member of the partition and nothing else. We study the following problem. Given a …

Kempe Chains and Rooted Minors

M Kriesell, S Mohr - imada.sdu.dk
A (minimal) transversal of a partition is a set which contains exactly one member from each
member of the partition and nothing else. We study the following problem. Given a …