Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s00373-019-02012-7 | Graphs and Combinatorics |
Keywords | Field | DocType |
Coloring, Clique minor, Kempe coloring, Line graph, 05c15, 05c40 | Graph,Combinatorics,Line graph,Existential quantification,Vertex (geometry),Connectivity,Mathematics,Branching (version control) | Journal |
Volume | Issue | ISSN |
35 | 2 | 0911-0119 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias Kriesell | 1 | 349 | 43.73 |
| s mohr | 2 | 0 | 2.03 |