The following pages link to (Q4876853):
Displaying 35 items.
- Super cyclically edge connected transitive graphs (Q411230) (← links)
- Infinitely many hypohamiltonian cubic graphs of girth 7 (Q659692) (← links)
- On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs (Q726495) (← links)
- On cyclic edge-connectivity of fullerenes (Q944718) (← links)
- Hamiltonian cycles in cubic Cayley graphs: The \(\langle 2,4k,3\rangle \) case (Q968235) (← links)
- \(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\) (Q989453) (← links)
- Graph structural properties of non-Yutsis graphs allowing fast recognition (Q1003683) (← links)
- On cyclic edge-connectivity of transitive graphs (Q1043988) (← links)
- Hamilton cycles and paths in vertex-transitive graphs-current directions (Q1044917) (← links)
- On perturbations of highly connected dyadic matroids (Q1787962) (← links)
- Cubic graphs that cannot be covered with four perfect matchings (Q2040017) (← links)
- Morphology of small snarks (Q2112562) (← links)
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs (Q2131857) (← links)
- Decomposition of cubic graphs with cyclic connectivity 5 (Q2166289) (← links)
- Girth, oddness, and colouring defect of snarks (Q2166293) (← links)
- The cubic graphs with finite cyclic vertex connectivity larger than girth (Q2214044) (← links)
- Small snarks with large oddness (Q2260625) (← links)
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions (Q2285396) (← links)
- The smallest nontrivial snarks of oddness 4 (Q2306590) (← links)
- Matching preclusion for cube-connected cycles (Q2352789) (← links)
- Super cyclically edge-connected vertex-transitive graphs of girth at least 5 (Q2392003) (← links)
- Super-cyclically edge-connected regular graphs (Q2392737) (← links)
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\) (Q2424662) (← links)
- A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs (Q2424828) (← links)
- Characterization of graphs with infinite cyclic edge connectivity (Q2483391) (← links)
- Semi-hyper-connected edge transitive graphs (Q2488948) (← links)
- Cubic Graphs with Large Circumference Deficit (Q3188672) (← links)
- Decompositions of Snarks into Repeated Dot-Products (Q3439439) (← links)
- (Q4701031) (← links)
- (Q4876853) (← links)
- Cubic Graphs with No Short Cycle Covers (Q5157388) (← links)
- Splittable and unsplittable graphs and configurations (Q5225018) (← links)
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (Q5225040) (← links)
- Atoms of cyclic edge connectivity in regular graphs (Q5963628) (← links)
- Perfect matchings in highly cyclically connected regular graphs (Q6057581) (← links)
