5 papers · 1 filter
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4
Christoph Brause, Trung Duy Doan, Přemysl Holub +4
For every graph , we consider the class of all connected -free graphs which are distinct from an odd cycle and have independence number at least , and we show…
Hadwiger meets Cayley
Jacob W. Cooper, Adam Kabela, Daniel Král' +1
We show that every connected -chromatic graph contains at least spanning trees.
Coloring graphs by translates in the circle
Pablo Candela, Carlos Catala, Robert Hancock +4
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base…
Trestles in the squares of graphs
Adam Kabela, Jakub Teska
We show that the square of every connected -free graph satisfying a matching condition has a -connected spanning subgraph of maximum degree at most~. Furthermore,…
On forbidden induced subgraphs for K_{1,3}-free perfect graphs
Christoph Brause, Přemysl Holub, Adam Kabela +3
Considering connected -free graphs with independence number at least , Chudnovsky and Seymour (2010) showed that every such graph, say , is -colourable where …