Rooted complete minors in line graphs with a Kempe coloring
M Kriesell, S Mohr - Graphs and Combinatorics, 2019 - Springer
M Kriesell, S Mohr
Graphs and Combinatorics, 2019•SpringerIt has been conjectured that if a finite graph has a vertex coloring such that the union of any
two color classes induces a connected graph, then for every set T of vertices containing
exactly one member from each color class there exists a complete minor such that T
contains exactly one member from each branching set. Here we prove the statement for line
graphs.
two color classes induces a connected graph, then for every set T of vertices containing
exactly one member from each color class there exists a complete minor such that T
contains exactly one member from each branching set. Here we prove the statement for line
graphs.
Abstract
It has been conjectured that if a finite graph has a vertex coloring such that the union of any two color classes induces a connected graph, then for every set T of vertices containing exactly one member from each color class there exists a complete minor such that T contains exactly one member from each branching set. Here we prove the statement for line graphs.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果