The following pages link to Induced subgraph
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Graph theory (links | edit)
- Ramsey's theorem (links | edit)
- Petersen graph (links | edit)
- Hypergraph (links | edit)
- Bipartite graph (links | edit)
- Component (graph theory) (links | edit)
- Clique problem (links | edit)
- Reconstruction conjecture (links | edit)
- Dynkin diagram (links | edit)
- Glossary of graph theory (links | edit)
- Interval graph (links | edit)
- Graph coloring (links | edit)
- Clique (graph theory) (links | edit)
- Matching (graph theory) (links | edit)
- Vertex (graph theory) (links | edit)
- Perfect graph (links | edit)
- Perfect graph theorem (links | edit)
- Line graph (links | edit)
- Graph homomorphism (links | edit)
- Strongly connected component (links | edit)
- Acyclic coloring (links | edit)
- Subcoloring (links | edit)
- Well-quasi-ordering (links | edit)
- Chordal graph (links | edit)
- Meyniel graph (links | edit)
- Strong perfect graph theorem (links | edit)
- Dilworth's theorem (links | edit)
- Order embedding (links | edit)
- Complement graph (links | edit)
- Cograph (links | edit)
- Radon's theorem (links | edit)
- Universal graph (links | edit)
- Structured program theorem (links | edit)
- Neil Robertson (mathematician) (links | edit)
- Desargues graph (links | edit)
- Graph property (links | edit)
- Dominating set (links | edit)
- Maximal independent set (links | edit)
- Szemerédi regularity lemma (links | edit)
- Arboricity (links | edit)
- Connected dominating set (links | edit)
- Dual graph (links | edit)
- Johnson graph (links | edit)
- Zarankiewicz problem (links | edit)
- Christofides algorithm (links | edit)
- Unit disk graph (links | edit)
- Transitive reduction (links | edit)
- Book embedding (links | edit)
- Structure (mathematical logic) (links | edit)
- Maximum common induced subgraph (links | edit)