Relative lengths of paths and cycles in 3-connected graphs

DOI10.1016/0012-365X(81)90159-XzbMath0448.05044OpenAlexW2068158377WikidataQ127492203 ScholiaQ127492203MaRDI QIDQ1146693

Stephen C. Locke, J. A. Bondy

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90159-x

zbMATH Keywords

length of paths

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (14)

Long paths and cycles in tough graphs ⋮ Cycle double covers of graphs with Hamilton paths ⋮ Characterizing forbidden pairs for relative length of longest paths and cycles ⋮ Length of longest cycles in a graph whose relative length is at least two ⋮ Balanced generic circuits without long paths ⋮ Relative lengths of paths and cycles in k-connected graphs ⋮ Cycles in weighted graphs ⋮ Color-critical graphs have logarithmic circumference ⋮ Long cycles in graphs without Hamiltonian paths ⋮ Large Wk- or K3,t-Minors in 3-Connected Graphs ⋮ Covering a graph by topological complete subgraphs ⋮ Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs ⋮ On relative length of longest paths and cycles ⋮ Long cycles in graphs on a fixed surface

Cites Work

• Relative lengths of paths and cycles in k-connected graphs
• Graphs in which every finite path is contained in a circuit
• 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 3-connected graphs