1 citations · 1 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2023★ 1 cited
Decomposition of (infinite) digraphs along directed 1-separations
Nathan Bowler, Florian Gut, Meike Hatzel +3
We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the s…
math.CO2012
Degree-doubling graph families
János Körner, Irene Muzi
Let G be a family of n-vertex graphs of uniform degree 2 with the property that the union of any two member graphs has degree four. We determine the leading term in the asymptotics…