Odd 2-factored snarks
arXiv:1210.8101 · doi:10.1016/j.ejc.2013.09.008
Abstract
A {\em snark} is a cubic cyclically 4-edge connected graph with edge chromatic number four and girth at least five. We say that a graph is {\em odd 2-factored} if for each 2-factor F of G each cycle of F is odd. In this paper, we present a method for constructing odd 2--factored snarks. In particular, we construct two families of odd 2-factored snarks that disprove a conjecture by some of the authors. Moreover, we approach the problem of characterizing odd 2-factored snarks furnishing a partial characterization of cyclically 4-edge connected odd 2-factored snarks. Finally, we pose a new conjecture regarding odd 2-factored snarks.
References in corpus (6)
- Generation and Properties of Snarks
- On the perfect matching index of bridgeless cubic graphs
- Pseudo and Strongly Pseudo 2--Factor Isomorphic Regular Graphs
- Irreducible pseudo 2-factor isomorphic cubic bipartite graphs
- Covering a cubic graph with perfect matchings
- On a family of cubic graphs containing the flower snarks