Strong Circuit Double Cover of Some Cubic Graphs

DOI10.1002/jgt.21794zbMath1306.05118OpenAlexW1578732428MaRDI QIDQ2940992

Cun-Quan Zhang, Wen Liang Tang, Zheng-Ke Miao

Publication date: 21 January 2015

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

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

zbMATH Keywords

Hamilton path\(Y\)-treestrong circuit double cover

Mathematics Subject Classification ID

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

Related Items (1)

Circuit Double Covers of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generation and properties of snarks
• Cycle covers (I) - minimal contra pairs and Hamilton weights
• Circuit double covers in special types of cubic graphs
• Proof of the strong 2-cover conjecture for planar graphs
• Semi-duality and the cycle double cover conjecture
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• Double covers of cubic graphs with oddness 4
• Five cycle double covers of some cubic graphs
• Reducible configurations for the cycle double cover conjecture
• Circuit Double Cover of Graphs
• Face colorings of embedded graphs
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Hamilton weights and Petersen minors
• Polyhedral decompositions of cubic graphs
• On cycle-double covers of graphs of small oddness

This page was built for publication: Strong Circuit Double Cover of Some Cubic Graphs