${4,5}$ Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski

DOI10.1137/120877817zbMath1268.05111OpenAlexW2018948753WikidataQ122884594 ScholiaQ122884594MaRDI QIDQ5300486

Kiyoshi Yoshimoto, Roman Čada, Shuya Chiba, Petr Vrána, Kenta Ozeki

Publication date: 27 June 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120877817

zbMATH Keywords

cyclescircuits2-factorscoverableedge-cutsdominating cycle conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs

This page was built for publication: ${4,5}$ Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski