scientific article; zbMATH DE number 874369
From MaRDI portal
Publication:4876853
zbMath0844.05066MaRDI QIDQ4876853
Publication date: 4 June 1996
Full work available at URL: https://eudml.org/doc/32343
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (35)
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ Cubic Graphs with Large Circumference Deficit ⋮ Super cyclically edge-connected vertex-transitive graphs of girth at least 5 ⋮ Super-cyclically edge-connected regular graphs ⋮ Unnamed Item ⋮ Decomposition of cubic graphs with cyclic connectivity 5 ⋮ Girth, oddness, and colouring defect of snarks ⋮ Perfect matchings in highly cyclically connected regular graphs ⋮ Super cyclically edge connected transitive graphs ⋮ A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\) ⋮ A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs ⋮ The cubic graphs with finite cyclic vertex connectivity larger than girth ⋮ Infinitely many hypohamiltonian cubic graphs of girth 7 ⋮ On cyclic edge-connectivity of fullerenes ⋮ Cubic Graphs with No Short Cycle Covers ⋮ Characterization of graphs with infinite cyclic edge connectivity ⋮ Hamiltonian cycles in cubic Cayley graphs: The \(\langle 2,4k,3\rangle \) case ⋮ Small snarks with large oddness ⋮ Semi-hyper-connected edge transitive graphs ⋮ \(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\) ⋮ On perturbations of highly connected dyadic matroids ⋮ On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs ⋮ Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions ⋮ Atoms of cyclic edge connectivity in regular graphs ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ Graph structural properties of non-Yutsis graphs allowing fast recognition ⋮ The smallest nontrivial snarks of oddness 4 ⋮ Splittable and unsplittable graphs and configurations ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Unnamed Item ⋮ On cyclic edge-connectivity of transitive graphs ⋮ Hamilton cycles and paths in vertex-transitive graphs-current directions ⋮ Decompositions of Snarks into Repeated Dot-Products ⋮ Morphology of small snarks ⋮ Matching preclusion for cube-connected cycles
Cites Work
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Removable edges in cyclically 4-edge-connected cubic graphs
- Non removable edges in 3-connected cubic graphs
- Uniform cyclic edge connectivity in cubic graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- A non-Hamiltonian planar graph
- Matching cutsets in graphs
- Connectivity of transitive graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
