Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs

DOI10.1016/j.ejc.2012.05.002zbMath1248.05149arXiv1002.1033OpenAlexW1538511848MaRDI QIDQ449212

Domenico Labbate, Marién Abreu, John Sheehan

Publication date: 12 September 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Flower snarks

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Infinite graphs (05C63)

Related Items (3)

Odd 2-factored snarks ⋮ Generation and properties of snarks ⋮ On 2-factor Hamiltonian regular bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs and digraphs with all 2-factors isomorphic
• Even cycles in directed graphs
• Tutte's edge-colouring conjecture
• 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
• Corrigendum to ``Graphs and digraphs with all 2-factors isomorphic [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]
• The Even Cycle Problem for Directed Graphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable

This page was built for publication: Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs