The following pages link to (Q2911581):
Displaying 15 items.
- Graphs with large generalized (edge-)connectivity (Q339485) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279) (← links)
- On the critical densities of minor-closed classes (Q1621066) (← links)
- Constructing edge-disjoint Steiner paths in lexicographic product networks (Q1738072) (← links)
- On the \(k\)-component independence number of a tree (Q2045314) (← links)
- Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs (Q2217476) (← links)
- A combinatorial characterization of finite groups of prime exponent (Q2288218) (← links)
- Toughness, binding number and restricted matching extension in a graph (Q2401801) (← links)
- Path-connectivity of lexicographic product graphs (Q2804863) (← links)
- Generalized connectivity of some total graphs (Q4959532) (← links)
- ON THE EMBEDDING OF GROUPS AND DESIGNS IN A DIFFERENCE BLOCK DESIGN (Q5012156) (← links)
- Graphs defined on groups (Q5102166) (← links)
- Contractible edges in longest cycles (Q6074596) (← links)
- Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph (Q6096357) (← links)
