Journal of Combinatorial Theory Series B
The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Tutte's edge-coloring conjecture
Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
On minimally one-factorable r-regular bipartite graphs
Discrete Mathematics
On 3-cut reductions of minimally 1-factorable cubic bigraphs
Discrete Mathematics - Special issue on the 17th british combinatorial conference selected papers
Disconnected 2-factors in planar cubic bridgeless graphs
Journal of Combinatorial Theory Series B
Characterizing minimally 1-factorable r-regular bipartite graphs
Discrete Mathematics
Journal of Combinatorial Theory Series B
Amalgams of Cubic Bipartite Graphs
Designs, Codes and Cryptography
Regular bipartite graphs with all 2-factors isomorphic
Journal of Combinatorial Theory Series B
Graphs and digraphs with all 2-factors isomorphic
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Pseudo 2-factor isomorphic regular bipartite graphs
Journal of Combinatorial Theory Series B
Det-extremal cubic bipartite graphs
Journal of Graph Theory
2-factors with prescribed and proscribed edges
Journal of Graph Theory
Irreducible pseudo 2-factor isomorphic cubic bipartite graphs
Designs, Codes and Cryptography
Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs
European Journal of Combinatorics
Hi-index | 0.00 |
A snark is a cubic cyclically 4-edge connected graph with edge chromatic number four and girth at least five. We say that a graph G is odd 2-factored if for each 2-factor F of G each cycle of F is odd. Some of the authors conjectured in Abreu et al. (2012) [4] that a snark G is odd 2-factored if and only if G is the Petersen graph, Blanusa 2, or a flower snark J(t), with t=5 and odd. Brinkmann et al. (2013) [10] have obtained two counterexamples that disprove this conjecture by performing an exhaustive computer search of all snarks of order n@?36. In this paper, we present a method for constructing odd 2-factored snarks. In particular, we independently construct the two odd 2-factored snarks that yield counterexamples to the above conjecture. 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.