Request a copy

Full Text

• Allie, I., Oddness to resistance ratios in cubic graphs. Discrete Math. 342 (2019), 387–392.
• Bonisoli, A., Cariolaro, D., Excessive factorizations of regular graphs. Graph Theory in Paris, 2007, Birkhauser, Basel, 73–84.
• Brinkmann, G., Coolsaet, K., Goedgebeur, J., Mélot, H., House of graphs: a database of interesting graphs. Discrete Appl. Math. 161 (2013), 311–314 Available at http://hog.grinvin.org/.
• Brinkmann, G., Goedgebeur, J., Hägglund, J., Markström, K., Generation and properties of snarks. J. Combin. Theory Ser. B 103 (2013), 468–488.
• Fiol, M.A., Mazzuoccolo, G., Steffen, E., Measures of edge-uncolorability of cubic graphs. Electron. J. Combin., 25, 2018, #P4.54.
• Fleischner, H., Cycle decompositions, 2-coverings, removable cycles and the four-color disease. Bondy, J.A., Murty, U.S.R., (eds.) Progress in Graph Theory, 1984, Academic Press, New York, 233–246.
• Fouquet, J.-L., Vanherpe, J.-M., On the perfect matching index of bridgeless cubic graphs. 2009.
• J. Goedgebeur, Source code of two programs to compute the oddness of a graph: http://caagt.ugent.be/oddness/.
• Goedgebeur, J., On the smallest snarks with oddness 4 and connectivity 2. Electron. J. Combin., 25, 2018, #P215.
• Goedgebeur, J., Máčajová, E., Škoviera, M., Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. Ars Math. Contemp. 16 (2019), 277–298.
• Häggkvist, R., McGuinness, S., Double covers of cubic graphs of oddness 4. J. Combin. Theory Ser. B 93 (2005), 251–277.
• Hägglund, J., On snarks that are far from being 3-edge-colorable. Electron. J. Combin., 23, 2016, #P2.6.
• Huck, A., Kochol, M., Five cycle double covers of some cubic graphs. J. Combin. Theory Ser. B 64 (1995), 119–125.
• Jaeger, F., Nowhere-zero flow problems. L.W. Beinecke, R.J. Wilson, (eds.) Selected Topics in Graph Theory 3, 1988, Academic Press, San Diego, CA, 71–95.
• Jin, L., Steffen, E., Petersen cores and the oddness of cubic graphs. J. Graph Theory 84 (2017), 109–120.
• Lukot'ka, R., Máčajová, E., Mazák, J., Škoviera, M., Small snarks with large oddness. Electron. J. Combin., 22, 2015, #P1.51.
• Lukot'ka, R., Mazák, J., Weak oddness as an approximation of oddness and resistance in cubic graphs. Discrete Appl. Math. 244 (2018), 223–226.
• Máčajová, E., Mazák, J., Cubic graphs with large circumference deficit. J. Graph Theory 82 (2016), 433–440.
• Mohar, B., Vodopivec, A., The genus of Petersen powers. J. Graph Theory 67 (2011), 1–8.
• Nedela, R., Škoviera, M., Atoms of cyclic connectivity in cubic graphs. Math. Slovaca 45 (1995), 481–499.
• Nedela, R., Škoviera, M., Decompositions and reductions of snarks. J. Graph Theory 22 (1996), 253–279.
• Robertson, N., Minimal cyclic-4-connected graphs. Trans. Amer. Math. Soc. 284 (1984), 665–687.
• Seymour, P.D., On multi-colourings of cubic graphs and conjectures of Fulkerson and Tutte. Proc. Lond. Math. Soc. 38 (1979), 423–460.
• Steffen, E., Classifications and characterizations of snarks. Discrete Math. 188 (1998), 183–203.
• Steffen, E., Measurements of edge-uncolorability. Discrete Math. 280 (2004), 191–214.
• Steffen, E., 1-Factor and cycle covers of cubic graphs. J. Graph Theory 78 (2015), 195–206.
• Steffen, E., Intersecting 1-factors and nowhere-zero 5-flows. Combinatorica 35 (2015), 633–640.
• Vodopivec, A., On embeddings of snarks in the torus. Discrete Math. 308 (2008), 1847–1849.