Pages that link to "Item:Q2197449"

The following pages link to On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs (Q2197449):

Displaying 10 items.

• New exact values of the maximum size of graphs free of topological complete subgraphs (Q870962) (← links)
• On the number of edges in a graph with no \((k + 1)\)-connected subgraphs (Q898127) (← links)
• The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices (Q1173631) (← links)
• An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\) (Q1584294) (← links)
• The extremal sizes of arc-maximal \((k, \ell)\)-digraphs (Q2117539) (← links)
• On the sizes of bi-\(k\)-maximal graphs (Q2307504) (← links)
• An extremal problem in subconnectivity (Q3789604) (← links)
• Edge‐maximal (<i>k, i</i>)‐graphs (Q4290576) (← links)
• The size of strength‐maximal graphs (Q4713006) (← links)
• Counting connected partitions of graphs (Q6606326) (← links)