35 citations · 160 across the 27 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 9 cited
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
Frantisek Kardos, Daniel Kral, Jan Volec
We show that for every cubic graph G with sufficiently large girth there exists a probability distribution on edge-cuts of G such that each edge is in a randomly chosen cut with pr…
math.CO2011★ 1 cited
On the Complexity of Planar Covering of Small Graphs
Ondřej Bílka, Jozef Jirásek, Pavel Klavík +2
The problem Cover(H) asks whether an input graph G covers a fixed graph H (i.e., whether there exists a homomorphism G to H which locally preserves the structure of the graphs). Co…