OurBigBook Wikipedia Bot
Documentation
Computational problems in graph theory
OurBigBook Wikipedia Bot
Mathematics
Fields of mathematics
Computational mathematics
toc
wiki
nosplit
articles:
176
Table of contents
176
1. Bipartite realization problem
link
nosplit
Computational problems in graph theory
2. Canadian traveller problem
link
nosplit
Computational problems in graph theory
3. Chinese postman problem
link
nosplit
Computational problems in graph theory
4. Clique cover
link
nosplit
Computational problems in graph theory
5. Clique problem
link
nosplit
Computational problems in graph theory
6. Connected dominating set
link
nosplit
Computational problems in graph theory
7. Correlation clustering
link
nosplit
Computational problems in graph theory
8. Degree diameter problem
link
nosplit
Computational problems in graph theory
9. Deterministic rendezvous problem
link
nosplit
Computational problems in graph theory
10. Digraph realization problem
link
nosplit
Computational problems in graph theory
11. Domatic number
link
nosplit
Computational problems in graph theory
12. Dominating set
link
nosplit
Computational problems in graph theory
13. Edge cover
link
nosplit
Computational problems in graph theory
14. Edge dominating set
link
nosplit
Computational problems in graph theory
15. Feedback arc set
link
nosplit
Computational problems in graph theory
16. Feedback vertex set
link
nosplit
Computational problems in graph theory
17. Frequent subtree mining
link
nosplit
Computational problems in graph theory
18. Good spanning tree
link
nosplit
Computational problems in graph theory
19. Graph coloring
link
nosplit
Computational problems in graph theory
68
19.1. Perfect graphs
link
nosplit
Graph coloring
19.2. Acyclic coloring
link
nosplit
Graph coloring
19.3. Adjacent-vertex-distinguishing-total coloring
link
nosplit
Graph coloring
19.4. Albertson conjecture
link
nosplit
Graph coloring
19.5. B-coloring
link
nosplit
Graph coloring
19.6. Brooks' theorem
link
nosplit
Graph coloring
19.7. Cereceda's conjecture
link
nosplit
Graph coloring
19.8. Chromatic polynomial
link
nosplit
Graph coloring
19.9. Cocoloring
link
nosplit
Graph coloring
19.10. Complete coloring
link
nosplit
Graph coloring
19.11. Conflict-free coloring
link
nosplit
Graph coloring
19.12. Critical graph
link
nosplit
Graph coloring
19.13. De Bruijn–Erdős theorem (graph theory)
link
nosplit
Graph coloring
19.14. Defective coloring
link
nosplit
Graph coloring
19.15. Distinguishing coloring
link
nosplit
Graph coloring
19.16. Earth–Moon problem
link
nosplit
Graph coloring
19.17. Edge coloring
link
nosplit
Graph coloring
19.18. Equitable coloring
link
nosplit
Graph coloring
19.19. Erdős–Faber–Lovász conjecture
link
nosplit
Graph coloring
19.20. Exact coloring
link
nosplit
Graph coloring
19.21. Five color theorem
link
nosplit
Graph coloring
19.22. Four color theorem
link
nosplit
Graph coloring
19.23. Fractional coloring
link
nosplit
Graph coloring
19.24. Gallai–Hasse–Roy–Vitaver theorem
link
nosplit
Graph coloring
19.25. Goldberg–Seymour conjecture
link
nosplit
Graph coloring
19.26. Graph coloring game
link
nosplit
Graph coloring
19.27. Greedy coloring
link
nosplit
Graph coloring
19.28. Grundy number
link
nosplit
Graph coloring
19.29. Grötzsch's theorem
link
nosplit
Graph coloring
19.30. Gyárfás–Sumner conjecture
link
nosplit
Graph coloring
19.31. Hadwiger conjecture (graph theory)
link
nosplit
Graph coloring
19.32. Hadwiger–Nelson problem
link
nosplit
Graph coloring
19.33. Hajós construction
link
nosplit
Graph coloring
19.34. Hamiltonian coloring
link
nosplit
Graph coloring
19.35. Harmonious coloring
link
nosplit
Graph coloring
19.36. Heawood conjecture
link
nosplit
Graph coloring
19.37. Heawood number
link
nosplit
Graph coloring
19.38. Hedetniemi's conjecture
link
nosplit
Graph coloring
19.39. Incidence coloring
link
nosplit
Graph coloring
19.40. Interval chromatic number of an ordered graph
link
nosplit
Graph coloring
19.41. Interval edge coloring
link
nosplit
Graph coloring
19.42. Kempe chain
link
nosplit
Graph coloring
19.43. L(2,1)-coloring
link
nosplit
Graph coloring
19.44. L(h, k)-coloring
link
nosplit
Graph coloring
19.45. List coloring
link
nosplit
Graph coloring
19.46. List edge-coloring
link
nosplit
Graph coloring
19.47. Monochromatic triangle
link
nosplit
Graph coloring
19.48. Open coloring axiom
link
nosplit
Graph coloring
19.49. Oriented coloring
link
nosplit
Graph coloring
19.50. Path coloring
link
nosplit
Graph coloring
19.51. Perfectly orderable graph
link
nosplit
Graph coloring
19.52. Precoloring extension
link
nosplit
Graph coloring
19.53. Rainbow coloring
link
nosplit
Graph coloring
19.54. Rainbow matching
link
nosplit
Graph coloring
19.55. Shift graph
link
nosplit
Graph coloring
19.56. Star coloring
link
nosplit
Graph coloring
19.57. Strong coloring
link
nosplit
Graph coloring
19.58. Subcoloring
link
nosplit
Graph coloring
19.59. Sum coloring
link
nosplit
Graph coloring
19.60. Symmetric hypergraph theorem
link
nosplit
Graph coloring
19.61. T-coloring
link
nosplit
Graph coloring
19.62. Total coloring
link
nosplit
Graph coloring
19.63. Tree-depth
link
nosplit
Graph coloring
19.64. Tricolorability
link
nosplit
Graph coloring
19.65. Uniquely colorable graph
link
nosplit
Graph coloring
19.66. Vizing's theorem
link
nosplit
Graph coloring
19.67. Well-colored graph
link
nosplit
Graph coloring
19.68. Χ-bounded
link
nosplit
Graph coloring
20. Graph cut optimization
link
nosplit
Computational problems in graph theory
21. Graph cuts in computer vision
link
nosplit
Computational problems in graph theory
22. Graph matching
link
nosplit
Computational problems in graph theory
23. Graph partition
link
nosplit
Computational problems in graph theory
24. Graph realization problem
link
nosplit
Computational problems in graph theory
25. Graph sandwich problem
link
nosplit
Computational problems in graph theory
26. Hamiltonian cycle polynomial
link
nosplit
Computational problems in graph theory
27. Hamiltonian path
link
nosplit
Computational problems in graph theory
28. Hamiltonian path problem
link
nosplit
Computational problems in graph theory
29. Independent set (graph theory)
link
nosplit
Computational problems in graph theory
30. Induced subgraph isomorphism problem
link
nosplit
Computational problems in graph theory
31. Instant Insanity
link
nosplit
Computational problems in graph theory
32. Longest uncrossed knight's path
link
nosplit
Computational problems in graph theory
33. Matching (graph theory)
link
nosplit
Computational problems in graph theory
28
33.1. Stable matching
link
nosplit
Matching (graph theory)
33.2. Assignment problem
link
nosplit
Matching (graph theory)
33.3. Berge's theorem
link
nosplit
Matching (graph theory)
33.4. Chord diagram (mathematics)
link
nosplit
Matching (graph theory)
33.5. Claw-free graph
link
nosplit
Matching (graph theory)
33.6. Factor-critical graph
link
nosplit
Matching (graph theory)
33.7. Fractional matching
link
nosplit
Matching (graph theory)
33.8. House allocation problem
link
nosplit
Matching (graph theory)
33.9. Hungarian algorithm
link
nosplit
Matching (graph theory)
33.10. Induced matching
link
nosplit
Matching (graph theory)
33.11. Kőnig's theorem (graph theory)
link
nosplit
Matching (graph theory)
33.12. Matching in hypergraphs
link
nosplit
Matching (graph theory)
33.13. Matching polytope
link
nosplit
Matching (graph theory)
33.14. Matching preclusion
link
nosplit
Matching (graph theory)
33.15. Maximally matchable edge
link
nosplit
Matching (graph theory)
33.16. Maximum cardinality matching
link
nosplit
Matching (graph theory)
33.17. Perfect matching
link
nosplit
Matching (graph theory)
33.18. Perfect matching in high-degree hypergraphs
link
nosplit
Matching (graph theory)
33.19. Petersen's theorem
link
nosplit
Matching (graph theory)
33.20. Pfaffian orientation
link
nosplit
Matching (graph theory)
33.21. Priority matching
link
nosplit
Matching (graph theory)
33.22. Rank-maximal allocation
link
nosplit
Matching (graph theory)
33.23. Ruzsa–Szemerédi problem
link
nosplit
Matching (graph theory)
33.24. Saturation (graph theory)
link
nosplit
Matching (graph theory)
33.25. Skew-symmetric graph
link
nosplit
Matching (graph theory)
33.26. Top trading cycle
link
nosplit
Matching (graph theory)
33.27. Tutte theorem
link
nosplit
Matching (graph theory)
33.28. Tutte–Berge formula
link
nosplit
Matching (graph theory)
34. MaxDDBS
link
nosplit
Computational problems in graph theory
35. Maximal independent set
link
nosplit
Computational problems in graph theory
36. Maximum agreement subtree problem
link
nosplit
Computational problems in graph theory
37. Maximum common edge subgraph
link
nosplit
Computational problems in graph theory
38. Maximum cut
link
nosplit
Computational problems in graph theory
39. Maximum flow problem
link
nosplit
Computational problems in graph theory
40. Maximum weight matching
link
nosplit
Computational problems in graph theory
41. Mixed Chinese postman problem
link
nosplit
Computational problems in graph theory
42. Multi-trials technique
link
nosplit
Computational problems in graph theory
43. Nonblocker
link
nosplit
Computational problems in graph theory
44. Nondeterministic constraint logic
link
nosplit
Computational problems in graph theory
45. Odd cycle transversal
link
nosplit
Computational problems in graph theory
46. Pebble motion problems
link
nosplit
Computational problems in graph theory
47. Planarity testing
link
nosplit
Computational problems in graph theory
48. Planted clique
link
nosplit
Computational problems in graph theory
49. Quadratic pseudo-Boolean optimization
link
nosplit
Computational problems in graph theory
50. Radio coloring
link
nosplit
Computational problems in graph theory
51. Set TSP problem
link
nosplit
Computational problems in graph theory
52. Spanning tree
link
nosplit
Computational problems in graph theory
24
52.1. Arboricity
link
nosplit
Spanning tree
52.2. Bridge protocol data unit
link
nosplit
Spanning tree
52.3. Capacitated minimum spanning tree
link
nosplit
Spanning tree
52.4. Degree-constrained spanning tree
link
nosplit
Spanning tree
52.5. Euclidean minimum spanning tree
link
nosplit
Spanning tree
52.6. Expected linear time MST algorithm
link
nosplit
Spanning tree
52.7. Grid bracing
link
nosplit
Spanning tree
52.8. K-minimum spanning tree
link
nosplit
Spanning tree
52.9. Kinetic minimum spanning tree
link
nosplit
Spanning tree
52.10. Markov chain tree theorem
link
nosplit
Spanning tree
52.11. Minimum-cost spanning tree game
link
nosplit
Spanning tree
52.12. Minimum degree spanning tree
link
nosplit
Spanning tree
52.13. Minimum routing cost spanning tree
link
nosplit
Spanning tree
52.14. Minimum spanning tree
link
nosplit
Spanning tree
52.15. Minimum spanning tree-based segmentation
link
nosplit
Spanning tree
52.16. Multiple Spanning Tree Protocol
link
nosplit
Spanning tree
52.17. Net (polyhedron)
link
nosplit
Spanning tree
52.18. Parallel algorithms for minimum spanning trees
link
nosplit
Spanning tree
52.19. Rectilinear minimum spanning tree
link
nosplit
Spanning tree
52.20. Spanning Tree Protocol
link
nosplit
Spanning tree
52.21. Tree spanner
link
nosplit
Spanning tree
52.22. Trémaux tree
link
nosplit
Spanning tree
52.23. Virtual Link Trunking
link
nosplit
Spanning tree
52.24. Xuong tree
link
nosplit
Spanning tree
53. Steiner tree problem
link
nosplit
Computational problems in graph theory
54. Strong connectivity augmentation
link
nosplit
Computational problems in graph theory
55. Vertex cover
link
nosplit
Computational problems in graph theory
56. Vertex cycle cover
link
nosplit
Computational problems in graph theory
Ancestors
Computational mathematics
Fields of mathematics
Mathematics
OurBigBook Wikipedia Bot