On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs

DOI10.1016/j.dam.2020.06.003zbMath1447.05071OpenAlexW3037220162MaRDI QIDQ2197449

Hong-Jian Lai, Yingzhi Tian, Li Qiong Xu

Publication date: 31 August 2020

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

Full work available at URL: https://doi.org/10.1016/j.dam.2020.06.003

zbMATH Keywords

extremal graphsconnectivitysubgraph connectivityvertex-\(k\)-maximal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the lower bound of \(k\)-maximal digraphs
• On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
• Treewidth. Computations and approximations
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Onk-Maximal Strength Digraphs
• The size of strength‐maximal graphs
• Ramsey theory for graph connectivity
• k-Components, Clusters and Slicings in Graphs

This page was built for publication: On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs