The following pages link to Immersing small complete graphs (Q3085021):
Displaying 18 items.
- Coloring immersion-free graphs (Q326817) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- Immersing complete digraphs (Q427820) (← links)
- The structure of graphs not admitting a fixed immersion (Q473098) (← links)
- Complete graph immersions in dense graphs (Q512586) (← links)
- A note on immersion minors and planarity (Q1744743) (← links)
- On clique immersions in line graphs (Q2005686) (← links)
- Clique immersions in graphs of independence number two with certain forbidden subgraphs (Q2022152) (← links)
- Immersion and clustered coloring (Q2099417) (← links)
- Large immersions in graphs with independence number 3 and 4 (Q2132349) (← links)
- Clique immersion in graphs without a fixed bipartite graph (Q2171024) (← links)
- Clique immersions and independence number (Q2674557) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- Constructing Graphs with No Immersion of Large Complete Graphs (Q2922213) (← links)
- Forbidding Kuratowski Graphs as Immersions (Q2940987) (← links)
- (Q5743487) (← links)
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion (Q5855529) (← links)
- Forcing clique immersions through chromatic number (Q5892297) (← links)
