On the lower bound of \(k\)-maximal digraphs

DOI10.1016/j.disc.2016.04.007zbMath1339.05162OpenAlexW2398587411MaRDI QIDQ294549

Hong-Jian Lai, Suohai Fan, Murong Xu, Xiaoxia Lin

Publication date: 16 June 2016

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

Full work available at URL: https://doi.org/10.1016/j.disc.2016.04.007

zbMATH Keywords

extremal digraphsmaximum subdigraph arc connectivitystrong arc connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (5)

On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs ⋮ On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs ⋮ On the sizes of bi-\(k\)-maximal graphs ⋮ On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs ⋮ The extremal sizes of arc-maximal \((k, \ell)\)-digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Onk-Maximal Strength Digraphs
• The size of strength‐maximal graphs
• Digraphs
• k-Components, Clusters and Slicings in Graphs

This page was built for publication: On the lower bound of \(k\)-maximal digraphs