Relative lengths of paths and cycles in k-connected graphs

DOI10.1016/0095-8956(82)90036-3zbMath0492.05048OpenAlexW1984867229MaRDI QIDQ1167743

Stephen C. Locke

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90036-3

zbMATH Keywords

covering of edges by cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (10)

Long paths and cycles in tough graphs ⋮ Characterizing forbidden pairs for relative length of longest paths and cycles ⋮ Extremal 3-connected graphs ⋮ Cycles and paths through specified vertices in k-connected graphs ⋮ Relative lengths of paths and cycles in 3-connected graphs ⋮ A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture ⋮ Relative length of longest paths and longest cycles in triangle-free graphs ⋮ A basis for the cycle space of a 2-connected graph ⋮ Long paths and cycles in random subgraphs of graphs with large minimum degree ⋮ On relative length of longest paths and cycles

Cites Work

• Unnamed Item
• Relative lengths of paths and cycles in 3-connected graphs
• Relative Lengths of Paths and Cycles in k-Connected Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Relative lengths of paths and cycles in k-connected graphs