A. Kabela

collaborators

4 papers

math.CO2020

Hadwiger meets Cayley

Jacob W. Cooper, Adam Kabela, Daniel Král' +1

We show that every connected $k$ -chromatic graph contains at least $k^{k - 2}$ spanning trees.

math.CO2020

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…

math.CO2020

Trestles in the squares of graphs

Adam Kabela, Jakub Teska

We show that the square of every connected $S (K_{1, 4})$ -free graph satisfying a matching condition has a $2$ -connected spanning subgraph of maximum degree at most~ $3$ . Furthermore,…

math.CO2019

On forbidden induced subgraphs for K_{1,3}-free perfect graphs

Christoph Brause, Přemysl Holub, Adam Kabela +3

Considering connected $K_{1, 3}$ -free graphs with independence number at least $3$ , Chudnovsky and Seymour (2010) showed that every such graph, say $G$ , is $2 ω$ -colourable where $ω$ …