The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices

DOI10.1016/0012-365X(90)90161-AzbMath0749.05041OpenAlexW2024152022MaRDI QIDQ1173631

Mao-cheng Cai

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90161-a

zbMATH Keywords

extremal graphssimple graphmaximum number of edges

Mathematics Subject Classification ID

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

Related Items (1)

The eavesdropping number of a graph

Cites Work

• Minimally k-connected graphs of low order and maximal size
• Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices