Short cycle covers of cubic graphs

DOI10.1002/JGT.3190180204zbMATH Open0831.05053OpenAlexW2021628833MaRDI QIDQ4284099FDOQ4284099

Authors: Genghua Fan 

Publication date: 12 February 1996

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180204

Recommendations

• Shortest circuit covers of cubic graphs
• Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
• Short cycle covers on cubic graphs by choosing a 2-factor
• A note on shortest cycle covers of cubic graphs
• Short cycle covers of graphs with minimum degree three

zbMATH Keywords

finite graphcubic graphscircuitscircuit coversshort cycle covers

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Flows and generalized coloring theorems in graphs
• A Reduction Method for Edge-Connectivity in Graphs
• A Class Of Abelian Groups
• Covering Multigraphs by Simple Circuits
• Shortest coverings of graphs with cycles
• Fulkerson's conjecture and circuit covers
• Tutte's 3-flow conjecture and short cycle covers
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• Covering Graphs by Cycles
• Short circuit covers for regular matroids with a nowhere zero 5-flow
• Shortest circuit covers of cubic graphs

Cited In (17)

• A note on shortest cycle covers of cubic graphs
• Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
• Sampling Edge Covers in 3-Regular Graphs
• Cycle covering in bridgeless graphs
• 1-factor and cycle covers of cubic graphs
• Signed cycle double covers
• Short cycle covers on cubic graphs by choosing a 2-factor
• Small cycle covers of 3-connected cubic graphs
• Integer 4-flows and cycle covers
• Cycles intersecting edge-cuts of prescribed sizes
• Cubic graphs with no short cycle covers
• Shortest circuit covers of signed graphs
• Cycle covers of cubic multigraphs
• Shortest coverings of graphs with cycles
• A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs
• Short cycle covers of graphs with minimum degree three
• Circuit decompositions and shortest circuit coverings of hypergraphs

This page was built for publication: Short cycle covers of cubic graphs

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