scientific article; zbMATH DE number 874369
From MaRDI portal
Publication:4876853
zbMATH Open0844.05066MaRDI QIDQ4876853FDOQ4876853
Authors: Roman Nedela, Martin Škoviera 
Publication date: 4 June 1996
Full work available at URL: https://eudml.org/doc/32343
Title of this publication is not available (Why is that?)
Recommendations
Cites Work
- Title not available (Why is that?)
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Title not available (Why is that?)
- Connectivity of transitive graphs
- Title not available (Why is that?)
- Matching cutsets in graphs
- Title not available (Why is that?)
- Removable edges in cyclically 4-edge-connected cubic graphs
- Uniform cyclic edge connectivity in cubic graphs
- A non-Hamiltonian planar graph
- Title not available (Why is that?)
- Non removable edges in 3-connected cubic graphs
Cited In (36)
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions
- Title not available (Why is that?)
- Atoms of cyclic edge connectivity in regular graphs
- Super cyclically edge connected transitive graphs
- Morphology of small snarks
- The cubic graphs with finite cyclic vertex connectivity larger than girth
- Perfect matchings in highly cyclically connected regular graphs
- On cyclic edge-connectivity of fullerenes
- On cyclic edge-connectivity of transitive graphs
- A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
- Small snarks with large oddness
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs
- Cubic graphs with no short cycle covers
- Hamiltonian cycles in cubic Cayley graphs: The \(\langle 2,4k,3\rangle \) case
- Hamilton cycles and paths in vertex-transitive graphs-current directions
- \(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\)
- Cubic graphs with large circumference deficit
- Graph structural properties of non-Yutsis graphs allowing fast recognition
- Decompositions of Snarks into Repeated Dot-Products
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
- Super-cyclically edge-connected regular graphs
- Semi-hyper-connected edge transitive graphs
- Cubic graphs that cannot be covered with four perfect matchings
- On perturbations of highly connected dyadic matroids
- Decomposition of cubic graphs with cyclic connectivity 5
- Girth, oddness, and colouring defect of snarks
- The smallest nontrivial snarks of oddness 4
- Super cyclically edge-connected vertex-transitive graphs of girth at least 5
- Title not available (Why is that?)
- Splittable and unsplittable graphs and configurations
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- Characterization of graphs with infinite cyclic edge connectivity
- Matching preclusion for cube-connected cycles
- Infinitely many hypohamiltonian cubic graphs of girth 7
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4876853)
