Structure Des Graphes De Connexite k ≥ 2 Et De Stabilite α = k + 2

DOI10.1016/S0304-0208(08)73367-XzbMath0525.05039OpenAlexW131845759MaRDI QIDQ3039388

Denise Amar, Irene Fournier, Anne Germa

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73367-x

zbMATH Keywords

stabilitylongest cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (1)

Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey

This page was built for publication: Structure Des Graphes De Connexite k ≥ 2 Et De Stabilite α = k + 2