Classification and characterizations of snarks
From MaRDI portal
Publication:1584327
Recommendations
- Special classes of snarks
- Generation and properties of snarks
- Snarks from a Kászonyi perspective: a survey
- scientific article; zbMATH DE number 3884206
- scientific article; zbMATH DE number 867669
- scientific article; zbMATH DE number 4093509
- Decompositions and reductions of snarks
- A unified framework for non-universal SNARKs
- The construction and reduction of strong snarks
- Factorisation of snarks
Cites work
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Construction of class two graphs with maximum vertex degree three
- Decomposition of snarks
- Decompositions and reductions of snarks
- Five cycle double covers of some cubic graphs
- scientific article; zbMATH DE number 3889544 (Why is no real title available?)
- scientific article; zbMATH DE number 3849273 (Why is no real title available?)
- scientific article; zbMATH DE number 3937197 (Why is no real title available?)
- scientific article; zbMATH DE number 3946183 (Why is no real title available?)
- scientific article; zbMATH DE number 4075098 (Why is no real title available?)
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 3728302 (Why is no real title available?)
- scientific article; zbMATH DE number 568843 (Why is no real title available?)
- scientific article; zbMATH DE number 867669 (Why is no real title available?)
- scientific article; zbMATH DE number 227006 (Why is no real title available?)
- scientific article; zbMATH DE number 3102311 (Why is no real title available?)
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Large Isaacs' graphs are maximally non-Hamilton-connected
- Network-Colourings
- On cycle-double covers of graphs of small oddness
- Polyhedral decompositions of cubic graphs
- Snarks and reducibility
- Snarks without small cycles
Cited in
(52)- Color-character of uncolorable cubic graphs
- Oddness to resistance ratios in cubic graphs
- Flows in signed graphs with two negative edges
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
- Weak oddness as an approximation of oddness and resistance in cubic graphs
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- 6-decomposition of snarks
- Special classes of snarks
- Measurements of edge-uncolorability
- Morphology of small snarks
- Snarks with resistance \(n\) and flow resistance \(2n\)
- 3-critical subgraphs of snarks
- Girth, oddness, and colouring defect of snarks
- Critical and flow-critical snarks coincide
- Some results on the structure of multipoles in the study of snarks
- Small snarks with large oddness
- Chromatic index of graphs with no cycle with a unique chord
- The smallest nontrivial snarks of oddness 4
- Nowhere-zero flows on signed regular graphs
- On parsimonious edge-colouring of graphs with maximum degree three
- Irreducible snarks of given order and cyclic connectivity
- On snarks that are far from being 3-edge colorable
- Maximum -edge-colorable subgraphs of class II graphs
- Petersen cores and the oddness of cubic graphs
- Minimal edge colorings of class 2 graphs and double graphs
- Cubic graphs with large circumference deficit
- Hypohamiltonian snarks have a 5-flow
- Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6
- Decompositions of Snarks into Repeated Dot-Products
- Some Topics in Graph Theory
- scientific article; zbMATH DE number 4093509 (Why is no real title available?)
- scientific article; zbMATH DE number 1737273 (Why is no real title available?)
- On Sylvester colorings of cubic graphs
- 1-factor and cycle covers of cubic graphs
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms
- Cubic graphs with colouring defect 3
- A note on reducing resistance in snarks
- Flow resistance to resistance ratios in cubic graphs
- Three measures of edge-uncolorability
- Reducible 3-critical graphs
- On resistance of graphs
- Measures of edge-uncolorability
- Graphs, disjoint matchings and some inequalities
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
- Measures of edge-uncolorability of cubic graphs
- Strictly critical snarks with girth or cyclic connectivity equal to 6
- Kempe equivalence classes of cubic graphs embedded on the projective plane
- Berge's conjecture for cubic graphs with small colouring defect
- Resistance in regular class two graphs
- Non-conflicting no-where zero Z₂ Z₂-flows in cubic graphs
- Fano colourings of cubic graphs and the Fulkerson conjecture
This page was built for publication: Classification and characterizations of snarks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584327)
