Shortest circuit covers of cubic graphs
From MaRDI portal
Publication:1322025
DOI10.1006/jctb.1994.1021zbMath0805.05065OpenAlexW1977200224MaRDI QIDQ1322025
Publication date: 26 January 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1021
Related Items (8)
Shortest circuit covers of signed graphs ⋮ A note on shortest cycle covers of cubic graphs ⋮ The construction and reduction of strong snarks ⋮ Short 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 ⋮ Signed cycle double covers ⋮ Integer 4-flows and cycle covers
This page was built for publication: Shortest circuit covers of cubic graphs
