Strengthening strong immersions with Kempe chains
Abstract
Every properly colored graph with $\chi(G)=k$ colors has edge-disjoint Kempe "backbones", Kempe chains anchored by color-critical vertices for each pair of colors. Certain color permutations arrange these backbones into a clique-like structure, a strengthening of strong immersions of complete graphs. This strengthened immersion is suggested as a template for identifying the disjoint subgraphs comprising Hadwiger's conjectured $K_k$ minor present in $k$-chromatic graphs.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2018
- DOI:
- arXiv:
- arXiv:1805.03729
- Bibcode:
- 2018arXiv180503729G
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- 7 pages, 5 figures