Pages that link to "Graph coloring"
Jump to navigation
Jump to search
The following pages link to Graph coloring:
Displaying 50 items.
- Boolean satisfiability problem (← links)
- Combinatorics (← links)
- Discrete mathematics (← links)
- Expander graph (← links)
- Four color theorem (← links)
- Gregory Chaitin (← links)
- Planar graph (← links)
- ♯P-complete (← links)
- Latin square (← links)
- Perfect matching (← links)
- Universal algebra (← links)
- NP-hardness (← links)
- Petersen graph (← links)
- Constraint satisfaction problem (← links)
- Colouring algorithm (redirect page) (← links)
- Bipartite graph (← links)
- Cycle space (← links)
- Erdős–Ko–Rado theorem (← links)
- Wolfgang Haken (← links)
- Boolean prime ideal theorem (← links)
- Inclusion–exclusion principle (← links)
- Outerplanar graph (← links)
- Graph minor (← links)
- Interval graph (← links)
- Static single-assignment form (← links)
- Coloring algorithm (redirect page) (← links)
- Register allocation (← links)
- Graph coloring algorithm (redirect page) (← links)
- Independent set (graph theory) (← links)
- Approximation algorithm (← links)
- Edge-transitive graph (← links)
- Parameterized complexity (← links)
- Hugo Hadwiger (← links)
- LLVM (← links)
- FNP (complexity) (← links)
- Perfect graph (← links)
- Chromatic number (redirect to section "Chromatic number") (← links)
- Four color theorem (← links)
- Girth (graph theory) (← links)
- Gamma (← links)
- Torus (← links)
- Chi (letter) (← links)
- Probabilistic method (← links)
- List of unsolved problems in mathematics (← links)
- Petersen graph (← links)
- Bipartite graph (← links)
- Clique problem (← links)
- Graph (discrete mathematics) (← links)
- Turán graph (← links)
- Turán's theorem (← links)
- Edward Nelson (← links)
- Clique (graph theory) (← links)
- Béla Bollobás (← links)
- Hugo Hadwiger (← links)
- Perfect graph (← links)
- Graph homomorphism (← links)
- Critical graph (← links)
- Harmonious coloring (← links)
- Fractional coloring (← links)
- Cocoloring (← links)
- List of terms relating to algorithms and data structures (← links)
- Chordal graph (← links)
- Dilworth's theorem (← links)
- Linkless embedding (← links)
- Perfect graph theorem (← links)
- Uniquely colorable graph (← links)
- Graph homomorphism (← links)
- Critical graph (← links)
- Edge coloring (← links)
- List coloring (← links)
- List edge-coloring (← links)
- Total coloring (← links)
- Complete coloring (← links)
- Exact coloring (← links)
- Acyclic coloring (← links)
- Strong coloring (← links)
- Erdős–Faber–Lovász conjecture (← links)