Five-cycle double cover and shortest cycle cover

DOI10.1002/JGT.23164MaRDI QIDQ6642514

Cun-Quan Zhang, Rong Luo, Rong-Xia Hao, Siyan Liu

Publication date: 24 November 2024

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

zbMATH Keywords

oddness4-flow4-even subgraph covershortest even subgraph cover

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sparsely intersecting perfect matchings in cubic graphs
• Tutte's 3-flow conjecture and short cycle covers
• Shortest coverings of graphs with cycles
• Short circuit covers for regular matroids with a nowhere zero 5-flow
• Short cycle covers and the cycle double cover conjecture
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• Fulkerson's conjecture and circuit covers
• Oddness to resistance ratios in cubic graphs
• Weak oddness as an approximation of oddness and resistance in cubic graphs
• Five cycle double covers of some cubic graphs
• Circuit double cover of graphs
• Short Cycle Covers of Graphs with Minimum Degree Three
• Short cycle covers of graphs and nowhere-zero flows
• On Perfect Matching Coverings and Even Subgraph Coverings
• Covering Multigraphs by Simple Circuits
• 1‐Factor and Cycle Covers of Cubic Graphs
• Polyhedral decompositions of cubic graphs
• 5-Cycle Double Covers, 4-Flows, and Catlin Reduction

This page was built for publication: Five-cycle double cover and shortest cycle cover

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