2-factor Hamiltonian graphs.
From MaRDI portal
Publication:1403914
DOI10.1016/S0095-8956(02)00031-XzbMath1045.05061MaRDI QIDQ1403914
Bill Jackson, Martin Funk, John Sheehan, Domenico Labbate
Publication date: 20 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items (16)
Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs ⋮ Regular bipartite graphs with all 2-factors isomorphic ⋮ Finding matching cuts in \(H\)-free graphs ⋮ A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture ⋮ Irreducible pseudo 2-factor isomorphic cubic bipartite graphs ⋮ Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs ⋮ Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs ⋮ Odd 2-factored snarks ⋮ Superposition of snarks revisited ⋮ An equivalent formulation of the Fan-Raspaud Conjecture and related problems ⋮ On 2-factor Hamiltonian regular bipartite 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 ⋮ On perfectly one–factorable cubic graphs ⋮ A counterexample to the pseudo 2-factor isomorphic graph conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Matching theory
- Independent dominating sets and a second hamiltonian cycle in regular graphs
- On minimally one-factorable \(r\)-regular bipartite graphs
- Characterizing minimally 1-factorable \(r\)-regular bipartite graphs
- A characterization of convertible (0,1)-matrices
- Permanents, Pfaffian orientations, and even directed circuits
- On the Number of Hamiltonian Cycles in Bipartite Graphs
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Even dicycles
- On Hamiltonian Circuits
- On 3-cut reductions of minimally 1-factorable cubic bigraphs
This page was built for publication: 2-factor Hamiltonian graphs.
