Maximum non-path-connected graphs

DOI10.1016/0095-8956(84)90063-7zbMath0537.05030OpenAlexW2031228549MaRDI QIDQ792336

George R. T. Hendry

Publication date: 1984

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(84)90063-7

zbMATH Keywords

path-connectivitypath of given length

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Cites Work

• Hamilton connected graphs
• Minimum number of edges in graphs that are both \(P_ 2-\) and \(P_ i- \)connected
• On path connected graphs
• Theory of path length distributions. I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum non-path-connected graphs