Long cycles in 3-cyclable graphs

DOI10.1016/S0012-365X(99)00331-3MaRDI QIDQ1978141zbMATH OpenOpenAlexFDO

Authors D. Bauer, L. McGuire, H. Trommel, Henk Jan Veldman

Publication date 28 August 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00331-3

zbMATH Keywords

connectivitylongest cyclecyclabledominating cycle

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 568790
• Length of longest cycles in a graph whose relative length is at least two
• scientific article; zbMATH DE number 3908470
• \(D_ \lambda\)-cycles in 3-cyclable graphs

Cited in

(8)

• Cyclability, connectivity and circumference
• On cycles in 3-connected graphs
• Cyclability of 3-connected graphs
• Long cycles in 3-connected graphs
• \(D_ \lambda\)-cycles in 3-cyclable graphs
• Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree
• Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs
• Longest cycles in 3-connected planar graphs

This page was built for publication: Long cycles in 3-cyclable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978141)