24 citations · 111 across the 46 of their papers we have counts for
4 papers · 1 filter
Double-critical graph conjecture for claw-free graphs
Martin Rolek, Zi-Xia Song
A connected graph with chromatic number is double-critical if is -colorable for each edge . The complete graphs are the only k…
Hadwiger's conjecture for graphs with forbidden holes
Zi-Xia Song, Brian Thomas
Given a graph , the Hadwiger number of , denoted by , is the largest integer such that contains the complete graph as a minor. A hole in is an induced…
Coloring Graphs with Forbidden Minors
Martin Rolek, Zi-Xia Song
Hadwiger's conjecture from 1943 states that for every integer , every graph either can be -colored or has a subgraph that can be contracted to the complete graph on …
Clique Minors in Double-critical Graphs
Martin Rolek, Zi-Xia Song
A connected -chromatic graph is \dfn{double-critical} if is -colorable for each edge . A long standing conjecture of Erdős and Lová…