Maximum non-path-connected graphs

DOI10.1016/0095-8956(84)90063-7zbMATH Open0537.05030OpenAlexW2031228549MaRDI QIDQ792336FDOQ792336

Authors: 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

Recommendations

• Connected graphs without long paths
• Various length paths in graphs
• scientific article; zbMATH DE number 4021183
• Maximum graphs not spannable by \(r\) disjoint paths
• Long path connectivity of regular graphs

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamilton connected graphs
• Theory of path length distributions. I
• Minimum number of edges in graphs that are both \(P_ 2-\) and \(P_ i- \)connected
• On path connected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Maximal buttonings of non-tree graphs
• Maximum graphs not spannable by \(r\) disjoint paths

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

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