Irreducible snarks of given order and cyclic connectivity
From MaRDI portal
Publication:2495514
DOI10.1016/j.disc.2006.02.003zbMath1092.05026MaRDI QIDQ2495514
Edita Máčajová, Martin Škoviera
Publication date: 30 June 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.02.003
05C15: Coloring of graphs and hypergraphs
Related Items
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44, Measures of edge-uncolorability of cubic graphs, Morphology of small snarks, Coverings of cubic graphs and 3-edge colorability, Superposition of snarks revisited, Some Topics in Graph Theory
Cites Work
- Construction of class two graphs with maximum vertex degree three
- Note sur la non existence d'un snark d'ordre 16
- A cyclically 6-edge-connected snark of order 118
- Classification and characterizations of snarks
- Snarks without small cycles
- Decomposition of snarks
- The NP-Completeness of Edge-Coloring
- Almost all cubic graphs are Hamiltonian
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Decompositions and reductions of snarks
- Network-Colourings
- Problem Session
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item