On the number of cycles in 3-connected cubic graphs
From MaRDI portal
Publication:1386478
DOI10.1006/JCTB.1997.1771zbMATH Open0918.05068OpenAlexW1973765733MaRDI QIDQ1386478FDOQ1386478
Authors: R. E. L. Aldred, Carsten Thomassen 
Publication date: 10 August 1998
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1997.1771
Recommendations
Cites Work
Cited In (22)
- The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
- Combinatorial Geometry and Graph Theory
- Regular graphs with few longest cycles
- A family of efficient six-regular circulants representable as a Kronecker product
- On cycles in 3-connected graphs
- Small cycle covers of 3-connected cubic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An 11-vertex theorem for 3-connected cubic graphs
- \(D_ \lambda\)-cycles in 3-cyclable graphs
- Edge reductions in cyclically \(k\)-connected cubic 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
- Title not available (Why is that?)
- 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)
