Odd 2-factored snarks
From MaRDI portal
Publication:2441652
DOI10.1016/j.ejc.2013.09.008zbMath1284.05206arXiv1210.8101MaRDI QIDQ2441652
Publication date: 25 March 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.8101
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
Berge–Fulkerson coloring for C(12)‐linked permutation graphs, Measures of edge-uncolorability of cubic graphs, Treelike snarks, Berge-Fulkerson coloring for some families of superposition snarks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On snarks that are far from being 3-edge colorable
- Covering a cubic graph with perfect matchings
- Irreducible pseudo 2-factor isomorphic cubic bipartite graphs
- Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs
- Generation and properties of snarks
- Graphs and digraphs with all 2-factors isomorphic
- Infinite classes of dihedral snarks
- Tutte's edge-colouring conjecture
- The Magma algebra system. I: The user language
- 2-factor Hamiltonian graphs.
- On minimally one-factorable \(r\)-regular bipartite graphs
- Characterizing minimally 1-factorable \(r\)-regular bipartite graphs
- Disconnected 2-factors in planar cubic bridgeless graphs
- Amalgams of cubic bipartite graphs
- Regular bipartite graphs with all 2-factors isomorphic
- Snarks without small cycles
- 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]
- On a family of cubic graphs containing the flower snarks
- The Determinant of the Adjacency Matrix of a Graph
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Det‐extremal cubic bipartite graphs
- 2‐factors with prescribed and proscribed edges
- Polyhedral decompositions of cubic graphs
- Blocking and anti-blocking pairs of polyhedra
- A Contribution to the Theory of Chromatic Polynomials
- On 3-cut reductions of minimally 1-factorable cubic bigraphs
