On the number of cycles in 3-connected cubic graphs
From MaRDI portal
(Redirected from Publication:1386478)
Recommendations
Cites work
- scientific article; zbMATH DE number 4010555 (Why is no real title available?)
- scientific article; zbMATH DE number 863469 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- Longest Cycles in 3-Connected 3-Regular Graphs
- Longest cycles in 3-connected cubic graphs
Cited in
(22)- The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
- A family of efficient six-regular circulants representable as a Kronecker product
- Combinatorial Geometry and Graph Theory
- Regular graphs with few longest cycles
- On cycles in 3-connected graphs
- Small cycle covers of 3-connected cubic graphs
- scientific article; zbMATH DE number 4079454 (Why is no real title available?)
- scientific article; zbMATH DE number 1916558 (Why is no real title available?)
- scientific article; zbMATH DE number 4154474 (Why is no real title available?)
- An 11-vertex theorem for 3-connected cubic graphs
- Edge reductions in cyclically \(k\)-connected cubic graphs
- \(D_ \lambda\)-cycles in 3-cyclable graphs
- Cycles in 5-connected triangulations
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
- Triangle-free graphs with the maximum number of cycles
- On the pagenumber of the cube-connected cycles
- On the number of cycles in a graph
- Enumeration of the degree sequences of 3-connected graphs and cactus graphs.
- Cyclability of 3-connected graphs
- scientific article; zbMATH DE number 4010555 (Why is no real title available?)
- HOW MANY n-CYCLES DOES PERIOD 3 IMPLY? AN ELEMENTARY APPROACH
- Graphs with cyclomatic number three having panconnected square
This page was built for publication: On the number of cycles in 3-connected cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386478)
