22 citations · 60 across the 24 of their papers we have counts for
4 papers · 2 filters
Cubical coloring -- fractional covering by cuts and semidefinite programming
Robert Šámal
We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and ten…
Unexpected behaviour of crossing sequences
Matt DeVos, Bojan Mohar, Robert Samal
The n-th crossing number of a graph G, denoted cr_n(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a>b>0, the…
Short Cycle Covers of Cubic Graphs and Graphs with Minimum Degree Three
Tomas Kaiser, Daniel Kral, Bernard Lidicky +2
The Shortest Cycle Cover Conjecture of Alon and Tarsi asserts that the edges of every bridgeless graph with edges can be covered by cycles of total length at most …
An Eberhard-like theorem for pentagons and heptagons
Matt DeVos, Agelos Georgakopoulos, Bojan Mohar +1
Eberhard proved that for every sequence of non-negative integers satisfying Euler's formula , there are infinitely many…