Decompositions and reductions of snarks

From MaRDI portal
Publication:4888119

DOI<253::AID-JGT6>3.0.CO;2-L 10.1002/(SICI)1097-0118(199607)22:3<253::AID-JGT6>3.0.CO;2-LzbMath0856.05082OpenAlexW4241899069MaRDI QIDQ4888119

Martin Škoviera, Roman Nedela

Publication date: 28 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199607)22:3<253::aid-jgt6>3.0.co;2-l




Related Items

On the total coloring of generalized Petersen graphsOn snarks that are far from being 3-edge colorableUnnamed ItemFlows in signed graphs with two negative edgesHypohamiltonian snarks have a 5-flow3-critical subgraphs of snarksGirth, oddness, and colouring defect of snarksEdge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphismsPetersen Cores and the Oddness of Cubic GraphsA polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)Cubic graphs with colouring defect 3Cyclic Vertex (Edge) Connectivity of Burnt Pancake GraphsLine-graphs of cubic graphs are normalReducible 3-critical graphsCircuits of length 5 in 2-factors of cubic graphsAsymptotic lower bounds on circular chromatic index of snarksThe cubic graphs with finite cyclic vertex connectivity larger than girthCoverings of cubic graphs and 3-edge colorabilityGeneration and properties of snarksCritical and flow-critical snarks coincideMeasures of edge-uncolorability of cubic graphsSimple cubic graphs with no short traveling salesman tourUnnamed Item6-decomposition of snarksSome results on the structure of multipoles in the study of snarksIrreducible snarks of given order and cyclic connectivityAltitude of regular graphs with girth at least fiveSome Topics in Graph TheoryContractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarksThe smallest nontrivial snarks of oddness 4Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44Classification and characterizations of snarks$K_2$-Hamiltonian Graphs: INormal 5-edge-colorings of a family of Loupekhine snarksHypohamiltonian Snarks with Cyclic Connectivity 5 and 6Decompositions of Snarks into Repeated Dot-ProductsContractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for SnarksMorphology of small snarksFano colourings of cubic graphs and the Fulkerson conjecture