Short Cycle Covers of Graphs with Minimum Degree Three

DOI10.1137/080717468zbMath1216.05048arXiv0908.1423OpenAlexW2082180692WikidataQ57601436 ScholiaQ57601436MaRDI QIDQ3084229

Robert Šámal, Pavel Nejedlý, Tomáš Kaiser, Bernard Lidický, Daniel Král'

Publication date: 15 March 2011

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

Full work available at URL: https://arxiv.org/abs/0908.1423

zbMATH Keywords

cycle double covercycle covershortest cycle cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Flows in graphs (05C21)

Related Items

A note on shortest cycle covers of cubic graphs, On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings, A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs, Short signed circuit covers of signed graphs, Some snarks are worse than others, Short cycle covers of graphs with at most 77\% vertices of degree two, Signed cycle double covers, Integer 4-flows and cycle covers, Cubic Graphs with No Short Cycle Covers, Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits, Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor, Short cycle covers of graphs and nowhere-zero flows, Note on integer 4-flows in graphs