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

DOI10.1016/J.DAM.2020.06.003zbMATH Open1447.05071OpenAlexW3037220162MaRDI QIDQ2197449FDOQ2197449

Authors Hong-Jian Lai, Yingzhi Tian, Liqiong 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

connectivityextremal graphssubgraph connectivityvertex-\(k\)-maximal graph

Mathematics Subject Classification ID

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

Recommendations

• The size of strength‐maximal graphs
• scientific article; zbMATH DE number 2191994
• scientific article; zbMATH DE number 91014
• Maximum number of edges in a critically \(k\)-connected graph
• On the number of edges in a graph with no \((k + 1)\)-connected subgraphs

Cites Work

• scientific article; zbMATH DE number 3590311 (Why is no real title available?)
• scientific article; zbMATH DE number 3627227 (Why is no real title available?)
• scientific article; zbMATH DE number 2191994 (Why is no real title available?)
• scientific article; zbMATH DE number 3312526 (Why is no real title available?)
• k-Components, Clusters and Slicings in Graphs
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Graph theory
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• On \(k\)-maximal strength digraphs
• On the lower bound of \(k\)-maximal digraphs
• On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
• Ramsey theory for graph connectivity
• The size of strength‐maximal graphs
• Treewidth. Computations and approximations

Cited In (11)

• Title not available (Why is no real title available?)
• Vicarious graphs
• The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
• Counting connected partitions of graphs
• Title not available (Why is no real title available?)
• On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
• Title not available (Why is no real title available?)
• New exact values of the maximum size of graphs free of topological complete subgraphs
• An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\)
• An extremal problem in subconnectivity
• On the sizes of bi-\(k\)-maximal graphs

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

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