Factorisation of snarks

MaRDI QIDQ2380465zbMATH OpenFDO

Authors Miroslav Chladný, Martin Škoviera

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/228345, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r32.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Decompositions and reductions of snarks
• A survey on snarks and new results: Products, reducibility and a computer search
• Irreducible snarks of given order and cyclic connectivity
• Snarks and reducibility
• On the number of colorings of a snark minus an edge

Cited in

(17)

• Cubic graphs with colouring defect 3
• Fractal networks: topology, dimension, and complexity
• Decompositions and reductions of snarks
• Morphology of small snarks
• Superposition of snarks revisited
• 6-decomposition of snarks
• From edge-coloring to strong edge-coloring
• Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
• Odd 2-factored snarks
• Irreducible snarks of given order and cyclic connectivity
• Classification and characterizations of snarks
• Measures of edge-uncolorability of cubic graphs
• Cubic graphs that cannot be covered with four perfect matchings
• Rotationally symmetric snarks from voltage graphs
• Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
• Critical and flow-critical snarks coincide
• The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark

This page was built for publication: Factorisation of snarks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380465)