Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity)

DOI10.1016/0166-218X(92)90285-IzbMath0675.90087OpenAlexW1978544400MaRDI QIDQ1122506

Jean-Claude Konig

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90285-i

zbMATH Keywords

connectivitymaximum degreek-connected graphsgraph of order irelinkage

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Superfluous edges and exponential expansions of de Bruijn and Kautz graphs

Cites Work

• Indestructive deletions of edges from graphs
• On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
• Unnamed Item

This page was built for publication: Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity)