\4,5\ is not coverable: a counterexample to a conjecture of Kaiser and Škrekovski

DOI10.1137/120877817zbMATH Open1268.05111OpenAlexW2018948753WikidataQ122884594 ScholiaQ122884594MaRDI QIDQ5300486FDOQ5300486

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

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

Recommendations

• scientific article; zbMATH DE number 26498
• Covering a graph with cycles passing through given edges
• scientific article; zbMATH DE number 1151805
• scientific article; zbMATH DE number 871188
• Cycles Intersecting Edge-Cuts of Prescribed Sizes

zbMATH Keywords

cyclescircuits2-factorscoverableedge-cutsdominating cycle conjecture

Mathematics Subject Classification ID

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

Cited In (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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300486)