2 citations · 6 across the 12 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
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…
math.CO2016★ 1 cited
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 …
math.CO2016★ 1 cited
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á…