Regular bipartite graphs with all 2-factors isomorphic

DOI10.1016/j.jctb.2004.05.002zbMath1059.05080OpenAlexW1977678149MaRDI QIDQ1880796

Domenico Labbate, John Sheehan, R. E. L. Aldred, Martin Funk, Bill Jackson

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.05.002

zbMATH Keywords

bipartite2-factorisomorphic\(k\)-regular

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Irreducible pseudo 2-factor isomorphic cubic bipartite graphs ⋮ Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs ⋮ Odd 2-factored snarks ⋮ On 2-factor Hamiltonian regular bipartite graphs ⋮ Pseudo 2-factor isomorphic regular bipartite graphs ⋮ Graphs and digraphs with all 2-factors isomorphic

Cites Work

• Unnamed Item
• Matching theory
• 2-factor Hamiltonian graphs.
• A characterization of convertible (0,1)-matrices
• Permanents, Pfaffian orientations, and even directed circuits
• Brace generation
• Det‐extremal cubic bipartite graphs
• Even dicycles

This page was built for publication: Regular bipartite graphs with all 2-factors isomorphic