Disconnected 2-factors in planar cubic bridgeless graphs

DOI10.1006/jctb.2001.2079zbMath1029.05123OpenAlexW2012246276MaRDI QIDQ1850589

Ajit A. Diwan

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2079

zbMATH Keywords

Hamilton cycle

Mathematics Subject Classification ID

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

Related Items (8)

Finding matching cuts in \(H\)-free graphs ⋮ Irreducible pseudo 2-factor isomorphic cubic bipartite graphs ⋮ Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs ⋮ Odd 2-factored snarks ⋮ Non-rainbow colorings of 3-, 4- and 5-connected plane graphs ⋮ Pseudo 2-factor isomorphic regular bipartite graphs ⋮ Graphs and digraphs with all 2-factors isomorphic ⋮ Chords of 2-factors in planar cubic bridgeless graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On Restricted Two-Factors
• The Planar Hamiltonian Circuit Problem is NP-Complete
• On Representatives of Subsets
• Paths, Trees, and Flowers
• The Factorization of Linear Graphs
• The Factors of Graphs

This page was built for publication: Disconnected 2-factors in planar cubic bridgeless graphs