Minimum number of edges in graphs that are both \(P_ 2-\) and \(P_ i- \)connected

DOI10.1016/0012-365X(83)90060-2zbMath0503.05038MaRDI QIDQ1173099

Yoko Usami

Publication date: 1983

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

zbMATH Keywords

elementary pathP(i)-connected

Mathematics Subject Classification ID

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

Related Items

Maximum number of edges in connected graphs with a given domination number, Maximum non-path-connected graphs

Cites Work

• Parallel concepts in graph theory
• Theory of path length distributions. I