Irreducible pseudo 2-factor isomorphic cubic bipartite graphs

DOI10.1007/s10623-011-9522-0zbMath1241.05097arXiv1002.1891OpenAlexW2013139804MaRDI QIDQ420625

Marién Abreu, Domenico Labbate, John Sheehan

Publication date: 22 May 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.1891

zbMATH Keywords

2-factorsirreducible configurationsLevi graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture ⋮ Odd 2-factored snarks ⋮ A counterexample to the pseudo 2-factor isomorphic graph conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Irreducible \((v_{3})\) configurations and graphs
• 2-factor Hamiltonian graphs.
• Disconnected 2-factors in planar cubic bridgeless graphs
• Regular bipartite graphs with all 2-factors isomorphic
• Pseudo 2-factor isomorphic regular bipartite graphs

This page was built for publication: Irreducible pseudo 2-factor isomorphic cubic bipartite graphs