Pseudo 2-factor isomorphic regular bipartite graphs

DOI10.1016/j.jctb.2007.08.006zbMath1134.05079OpenAlexW2057076239MaRDI QIDQ2477633

John Sheehan, Domenico Labbate, Marién Abreu, Ajit A. Diwan, Bill Jackson

Publication date: 14 March 2008

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.2007.08.006

zbMATH Keywords

bipartiteconnectivity2-factorcircuits

Mathematics Subject Classification ID

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

Related Items (5)

A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture ⋮ Irreducible pseudo 2-factor isomorphic cubic bipartite graphs ⋮ Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs ⋮ Odd 2-factored snarks ⋮ A counterexample to the pseudo 2-factor isomorphic graph conjecture

Cites Work

• Matching theory
• Two results on matching extensions with prescribed and proscribed edge sets
• 2-factor Hamiltonian graphs.
• Short solution of Kotzig's problem for bipartite graphs
• Disconnected 2-factors in planar cubic bridgeless graphs
• Regular bipartite graphs with all 2-factors isomorphic
• The Even Cycle Problem for Directed Graphs
• Even dicycles
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pseudo 2-factor isomorphic regular bipartite graphs