On the extremal sizes of maximal graphs without ( k + 1 )-connected subgraphs
From MaRDI portal
Publication:2197449
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
Recommendations
Cites Work
- Graph theory
- Title not available (Why is that?)
- Treewidth. Computations and approximations
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- On the lower bound of \(k\)-maximal digraphs
- On \(k\)-maximal strength digraphs
- Title not available (Why is that?)
- The size of strength‐maximal graphs
- Title not available (Why is that?)
- k-Components, Clusters and Slicings in Graphs
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Ramsey theory for graph connectivity
- Title not available (Why is that?)
- On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
Cited In (11)
- Title not available (Why is that?)
- Vicarious graphs
- The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
- Counting connected partitions of graphs
- Title not available (Why is that?)
- On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
- Title not available (Why is that?)
- 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)
