Pages that link to "Item:Q4201396"
From MaRDI portal
The following pages link to Connectivity, graph minors, and subgraph multiplicity (Q4201396):
Displaying 18 items.
- On the maximum number of cliques in a graph (Q995772) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Arboricity and bipartite subgraph listing algorithms (Q1334644) (← links)
- Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees (Q2057597) (← links)
- On the number of connected subgraphs of graphs (Q2243091) (← links)
- Generalized planar Turán numbers (Q2665977) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Connecting Terminals and 2-Disjoint Connected Subgraphs (Q2864321) (← links)
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics (Q3183462) (← links)
- On sparse subgraphs preserving connectivity properties (Q4201383) (← links)
- The Minset-Poset Approach to Representations of Graph Connectivity (Q4962223) (← links)
- Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs (Q5019804) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- Subgraph densities in a surface (Q5886343) (← links)
- The maximum number of paths of length three in a planar graph (Q6057639) (← links)
- Bounding the number of odd paths in planar graphs via convex optimization (Q6606323) (← links)
- The maximum number of pentagons in a planar graph (Q6657591) (← links)
