An extremal problem in subconnectivity

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(198710)34:5<683::AID-NAV3220340508>3.0.CO;2-I" /><683::AID-NAV3220340508>3.0.CO;2-I 10.1002/1520-6750(198710)34:5<683::AID-NAV3220340508>3.0.CO;2-IzbMath0646.05043OpenAlexW2007385465MaRDI QIDQ3789604

No author found.

Publication date: 1987

Full work available at URL: https://doi.org/10.1002/1520-6750(198710)34:5<683::aid-nav3220340508>3.0.co;2-i

zbMATH Keywords

connectivitysubgraphextremal problemsubconnectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte

This page was built for publication: An extremal problem in subconnectivity