Showing math.COShow all
2 papers · 1 filter
math.CO2022
Taming graphs with no large creatures and skinny ladders
Jakub Gajarský, Lars Jaffke, Paloma T. Lima +4
We confirm a conjecture of Gartland and Lokshtanov [arXiv:2007.08761]: if for a hereditary graph class there exists a constant such that no member of $\mathcal{G}…
math.CO2015
Graphs in which some and every maximum matching is uniquely restricted
Lucia Draque Penso, Dieter Rautenbach, Ueverton dos Santos Souza
A matching in a graph is uniquely restricted if there is no matching in that is distinct from but covers the same vertices as . Solving a problem posed by G…