Showing math.COShow all
3 papers · 1 filter
math.CO2019
The hamiltonicity of essentially 9-connected line graphs
Tomáš Kaiser, Petr Vrána
Yang et al. proved that every 3-connected, essentially 11-connected line graph is Hamilton-connected. This was extended by Li and Yang to 3-connected, essentially 10-connected grap…
math.CO2019
Edge-critical subgraphs of Schrijver graphs
Tomáš Kaiser, Matěj Stehlík
For and , the Kneser graph has all -element subsets of an -element set as vertices; two such subsets are adjacent if they are disjoint. It was f…
math.CO2017
Shorter signed circuit covers of graphs
Tomáš Kaiser, Robert Lukot'ka, Edita Máčajová +1
A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero flow. We show that each flow-admissible signed graph on edges can be covered b…