Long cycles in 3-cyclable graphs

DOI10.1016/S0012-365X(99)00331-3zbMATH Open0943.05051OpenAlexW2172283847MaRDI QIDQ1978141FDOQ1978141

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

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

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

zbMATH Keywords

connectivitylongest cyclecyclabledominating cycle

Mathematics Subject Classification ID

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

Cited In (8)

• 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
• On cycles in 3-connected graphs
• Longest cycles in 3-connected planar graphs
• Long cycles in 3-connected graphs
• \(D_ \lambda\)-cycles in 3-cyclable graphs
• Cyclability, connectivity and circumference
• Cyclability of 3-connected 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)