Superposition of snarks revisited
From MaRDI portal
Publication:2225424
DOI10.1016/j.ejc.2020.103220zbMath1458.05173OpenAlexW3082738679MaRDI QIDQ2225424
Edita Máčajová, Martin Škoviera
Publication date: 8 February 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2020.103220
Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
5-Cycle Double Covers, 4-Flows, and Catlin Reduction ⋮ Girth, oddness, and colouring defect of snarks ⋮ Deciding whether four perfect matchings can cover the edges of a snark is NP-complete ⋮ Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction ⋮ Morphology of small snarks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of permutation snarks
- Generation and properties of snarks
- Infinitely many hypohamiltonian cubic graphs of girth 7
- Measures of edge-uncolorability of cubic graphs
- The number of homeomorphically irreducible trees, and other species
- Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6
- 2-factor Hamiltonian graphs.
- Snarks and flow-snarks constructed from coloring-snarks.
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows
- Snarks with special spanning trees
- Snarks without small cycles
- Cycle double covers and non-separating cycles
- Cyclically five-connected cubic graphs
- Irreducible snarks of given order and cyclic connectivity
- Snarks with given real flow numbers
- Polyhedral embeddings of snarks in orientable surfaces
- The NP-Completeness of Edge-Coloring
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Construction of graphs with given circular flow numbers
- On homeomorphically irreducible spanning trees in cubic graphs
- Graphs with homeomorphically irreducible spanning trees
- On the strong circular 5‐flow conjecture
- Network-Colourings
This page was built for publication: Superposition of snarks revisited