Pages that link to "Graph coloring"
From HandWiki
The following pages link to Graph coloring:
Displayed 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Pseudoforest (← links)
- Meyniel graph (← links)
- Chordal graph (← links)
- Snark (graph theory) (← links)
- Cograph (← links)
- Critical graph (← links)
- Linear forest (← links)
- Word-representable graph (← links)
- Even-hole-free graph (← links)
- Expander graph (← links)
- Apex graph (← links)
- Planar graph (← links)
- Triangle-free graph (← links)
- Frankl–Rödl graph (← links)
- Graph minor (← links)
- Constraint satisfaction (← links)
- Cereceda's conjecture (← links)
- Circular coloring (← links)
- Complexity of constraint satisfaction (← links)
- Hypercube graph (← links)
- Constraint satisfaction problem (← links)
- Hanoi graph (← links)
- Rook's graph (← links)
- Pancake graph (← links)
- Sudoku graph (← links)
- Maekawa's theorem (← links)
- Unit disk graph (← links)
- Unit distance graph (← links)
- Signed graph (← links)
- Indifference graph (← links)
- Interval graph (← links)
- Penny graph (← links)
- Hamiltonian coloring (← links)
- Precoloring extension (← links)
- List edge-coloring (← links)
- Distinguishing coloring (← links)
- Disjunctive graph (← links)
- Equitable coloring (← links)
- Subcoloring (← links)
- Packing in a hypergraph (← links)
- Register allocation (← links)
- Erdős on Graphs (← links)
- Path coloring (← links)
- Brooks' theorem (← links)
- Regular icosahedron (← links)
- Incidence (graph) (← links)
- Tolerance graph (← links)
- Fractional coloring (← links)
- Orientation (graph theory) (← links)
- Gallai–Hasse–Roy–Vitaver theorem (← links)
