47 citations · 678 across the 85 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.CO2009★ 30 cited
Rank-width and Tree-width of H-minor-free Graphs
Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos
We prove that for any fixed r>=2, the tree-width of graphs not containing K_r as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of the…
math.CO2009★ 18 cited
Perfect Matchings in Claw-free Cubic Graphs
Sang-il Oum
Lovasz and Plummer conjectured that there exists a fixed positive constant c such that every cubic n-vertex graph with no cutedge has at least 2^(cn) perfect matchings. Their conje…