Pages that link to "Item:Q648982"
From MaRDI portal
The following pages link to On the maximum number of cliques in a graph embedded in a surface (Q648982):
Displaying 9 items.
- Cliques in graphs excluding a complete graph minor (Q311514) (← links)
- Irreducible triangulations are small (Q974471) (← links)
- A fast algorithm for computing irreducible triangulations of closed surfaces in \(\mathbb{E}^d\) (Q1699303) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- Number of Cliques in Graphs with a Forbidden Subdivision (Q3449861) (← links)
- (Q5002730) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
- Subgraph densities in a surface (Q5886343) (← links)