An extremal problem in subconnectivity

DOI10.1002/1520-6750(198710)34:5%3C683::AID-NAV3220340508%3E3.0.CO;2-IzbMATH Open0646.05043OpenAlexW2007385465MaRDI QIDQ3789604FDOQ3789604

Authors:

Publication date: 1987

Full work available at URL: https://doi.org/10.1002/1520-6750(198710)34:5%3C683::aid-nav3220340508%3E3.0.co;2-i

Recommendations

• An edge extremal result for subcohesion
• scientific article; zbMATH DE number 3977034
• On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
• An extremal problem on the connectivity of graphs
• scientific article; zbMATH DE number 867714

zbMATH Keywords

connectivityextremal problemsubgraphsubconnectivity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Connection problems via lowering operators
• An edge extremal result for subcohesion

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789604)