OurBigBook
About
$
Donate
Sign in
+
Sign up
by
Wikipedia Bot
(
@wikibot,
0
)
Computational mathematics
Index
Mathematics
Fields of mathematics
Like
(0)
0 By others
on same topic
0 Discussions
1970-01-01
See my version
Table of contents
Computational problems in graph theory
Computational mathematics
Bipartite realization problem
Computational problems in graph theory
Canadian traveller problem
Computational problems in graph theory
Chinese postman problem
Computational problems in graph theory
Clique cover
Computational problems in graph theory
Clique problem
Computational problems in graph theory
Connected dominating set
Computational problems in graph theory
Correlation clustering
Computational problems in graph theory
Degree diameter problem
Computational problems in graph theory
Deterministic rendezvous problem
Computational problems in graph theory
Digraph realization problem
Computational problems in graph theory
Domatic number
Computational problems in graph theory
Dominating set
Computational problems in graph theory
Edge cover
Computational problems in graph theory
Edge dominating set
Computational problems in graph theory
Feedback arc set
Computational problems in graph theory
Feedback vertex set
Computational problems in graph theory
Frequent subtree mining
Computational problems in graph theory
Good spanning tree
Computational problems in graph theory
Graph coloring
Computational problems in graph theory
Perfect graphs
Graph coloring
Acyclic coloring
Graph coloring
Adjacent-vertex-distinguishing-total coloring
Graph coloring
Albertson conjecture
Graph coloring
B-coloring
Graph coloring
Brooks' theorem
Graph coloring
Cereceda's conjecture
Graph coloring
Chromatic polynomial
Graph coloring
Cocoloring
Graph coloring
Complete coloring
Graph coloring
Conflict-free coloring
Graph coloring
Critical graph
Graph coloring
De Bruijn–Erdős theorem (graph theory)
Graph coloring
Defective coloring
Graph coloring
Distinguishing coloring
Graph coloring
Earth–Moon problem
Graph coloring
Edge coloring
Graph coloring
Equitable coloring
Graph coloring
Erdős–Faber–Lovász conjecture
Graph coloring
Exact coloring
Graph coloring
Five color theorem
Graph coloring
Four color theorem
Graph coloring
Fractional coloring
Graph coloring
Gallai–Hasse–Roy–Vitaver theorem
Graph coloring
Goldberg–Seymour conjecture
Graph coloring
Graph coloring game
Graph coloring
Greedy coloring
Graph coloring
Grundy number
Graph coloring
Grötzsch's theorem
Graph coloring
Gyárfás–Sumner conjecture
Graph coloring
Hadwiger conjecture (graph theory)
Graph coloring
Hadwiger–Nelson problem
Graph coloring
Hajós construction
Graph coloring
Hamiltonian coloring
Graph coloring
Harmonious coloring
Graph coloring
Heawood conjecture
Graph coloring
Heawood number
Graph coloring
Hedetniemi's conjecture
Graph coloring
Incidence coloring
Graph coloring
Interval chromatic number of an ordered graph
Graph coloring
Interval edge coloring
Graph coloring
Kempe chain
Graph coloring
L(2,1)-coloring
Graph coloring
L(h, k)-coloring
Graph coloring
List coloring
Graph coloring
List edge-coloring
Graph coloring
Monochromatic triangle
Graph coloring
Open coloring axiom
Graph coloring
Oriented coloring
Graph coloring
Path coloring
Graph coloring
Perfectly orderable graph
Graph coloring
Precoloring extension
Graph coloring
Rainbow coloring
Graph coloring
Rainbow matching
Graph coloring
Shift graph
Graph coloring
Star coloring
Graph coloring
Strong coloring
Graph coloring
Subcoloring
Graph coloring
Sum coloring
Graph coloring
Symmetric hypergraph theorem
Graph coloring
T-coloring
Graph coloring
Total coloring
Graph coloring
Tree-depth
Graph coloring
Tricolorability
Graph coloring
Uniquely colorable graph
Graph coloring
Vizing's theorem
Graph coloring
Well-colored graph
Graph coloring
Χ-bounded
Graph coloring
Graph cut optimization
Computational problems in graph theory
Graph cuts in computer vision
Computational problems in graph theory
Graph matching
Computational problems in graph theory
Graph partition
Computational problems in graph theory
Graph realization problem
Computational problems in graph theory
Graph sandwich problem
Computational problems in graph theory
Hamiltonian cycle polynomial
Computational problems in graph theory
Hamiltonian path
Computational problems in graph theory
Hamiltonian path problem
Computational problems in graph theory
Independent set (graph theory)
Computational problems in graph theory
Induced subgraph isomorphism problem
Computational problems in graph theory
Instant Insanity
Computational problems in graph theory
Longest uncrossed knight's path
Computational problems in graph theory
Matching (graph theory)
Computational problems in graph theory
Stable matching
Matching (graph theory)
Assignment problem
Matching (graph theory)
Berge's theorem
Matching (graph theory)
Chord diagram (mathematics)
Matching (graph theory)
Claw-free graph
Matching (graph theory)
Factor-critical graph
Matching (graph theory)
Fractional matching
Matching (graph theory)
House allocation problem
Matching (graph theory)
Hungarian algorithm
Matching (graph theory)
Induced matching
Matching (graph theory)
Kőnig's theorem (graph theory)
Matching (graph theory)
Matching in hypergraphs
Matching (graph theory)
Matching polytope
Matching (graph theory)
Matching preclusion
Matching (graph theory)
Maximally matchable edge
Matching (graph theory)
Maximum cardinality matching
Matching (graph theory)
Perfect matching
Matching (graph theory)
Perfect matching in high-degree hypergraphs
Matching (graph theory)
Petersen's theorem
Matching (graph theory)
Pfaffian orientation
Matching (graph theory)
Priority matching
Matching (graph theory)
Rank-maximal allocation
Matching (graph theory)
Ruzsa–Szemerédi problem
Matching (graph theory)
Saturation (graph theory)
Matching (graph theory)
Skew-symmetric graph
Matching (graph theory)
Top trading cycle
Matching (graph theory)
Tutte theorem
Matching (graph theory)
Tutte–Berge formula
Matching (graph theory)
MaxDDBS
Computational problems in graph theory
Maximal independent set
Computational problems in graph theory
Maximum agreement subtree problem
Computational problems in graph theory
Maximum common edge subgraph
Computational problems in graph theory
Maximum cut
Computational problems in graph theory
Maximum flow problem
Computational problems in graph theory
Maximum weight matching
Computational problems in graph theory
Mixed Chinese postman problem
Computational problems in graph theory
Multi-trials technique
Computational problems in graph theory
Nonblocker
Computational problems in graph theory
Nondeterministic constraint logic
Computational problems in graph theory
Odd cycle transversal
Computational problems in graph theory
Pebble motion problems
Computational problems in graph theory
Planarity testing
Computational problems in graph theory
Planted clique
Computational problems in graph theory
Quadratic pseudo-Boolean optimization
Computational problems in graph theory
Radio coloring
Computational problems in graph theory
Set TSP problem
Computational problems in graph theory
Spanning tree
Computational problems in graph theory
Arboricity
Spanning tree
Bridge protocol data unit
Spanning tree
Capacitated minimum spanning tree
Spanning tree
Degree-constrained spanning tree
Spanning tree
Euclidean minimum spanning tree
Spanning tree
Expected linear time MST algorithm
Spanning tree
Grid bracing
Spanning tree
K-minimum spanning tree
Spanning tree
Kinetic minimum spanning tree
Spanning tree
Markov chain tree theorem
Spanning tree
Minimum-cost spanning tree game
Spanning tree
Minimum degree spanning tree
Spanning tree
Minimum routing cost spanning tree
Spanning tree
Minimum spanning tree
Spanning tree
Minimum spanning tree-based segmentation
Spanning tree
Multiple Spanning Tree Protocol
Spanning tree
Net (polyhedron)
Spanning tree
Parallel algorithms for minimum spanning trees
Spanning tree
Rectilinear minimum spanning tree
Spanning tree
Spanning Tree Protocol
Spanning tree
Tree spanner
Spanning tree
Trémaux tree
Spanning tree
Virtual Link Trunking
Spanning tree
Xuong tree
Spanning tree
Steiner tree problem
Computational problems in graph theory
Strong connectivity augmentation
Computational problems in graph theory
Vertex cover
Computational problems in graph theory
Vertex cycle cover
Computational problems in graph theory
Korovkin approximation
Computational mathematics
Timeline of computational mathematics
Computational mathematics
Computational problems in graph theory
0
0
0
Computational mathematics
Bipartite realization problem
0
0
0
Computational problems in graph theory
Canadian traveller problem
0
0
0
Computational problems in graph theory
Chinese postman problem
0
0
0
Computational problems in graph theory
Clique cover
0
0
0
Computational problems in graph theory
Clique problem
0
0
0
Computational problems in graph theory
Connected dominating set
0
0
0
Computational problems in graph theory
Correlation clustering
0
0
0
Computational problems in graph theory
Degree diameter problem
0
0
0
Computational problems in graph theory
Deterministic rendezvous problem
0
0
0
Computational problems in graph theory
Digraph realization problem
0
0
0
Computational problems in graph theory
Domatic number
0
0
0
Computational problems in graph theory
Dominating set
0
0
0
Computational problems in graph theory
Edge cover
0
0
0
Computational problems in graph theory
Edge dominating set
0
0
0
Computational problems in graph theory
Feedback arc set
0
0
0
Computational problems in graph theory
Feedback vertex set
0
0
0
Computational problems in graph theory
Frequent subtree mining
0
0
0
Computational problems in graph theory
Good spanning tree
0
0
0
Computational problems in graph theory
Graph coloring
0
0
0
Computational problems in graph theory
Perfect graphs
0
0
0
Graph coloring
Acyclic coloring
0
0
0
Graph coloring
Adjacent-vertex-distinguishing-total coloring
0
0
0
Graph coloring
Albertson conjecture
0
0
0
Graph coloring
B-coloring
0
0
0
Graph coloring
Brooks' theorem
0
0
0
Graph coloring
Cereceda's conjecture
0
0
0
Graph coloring
Chromatic polynomial
0
0
0
Graph coloring
Cocoloring
0
0
0
Graph coloring
Complete coloring
0
0
0
Graph coloring
Conflict-free coloring
0
0
0
Graph coloring
Critical graph
0
0
0
Graph coloring
De Bruijn–Erdős theorem (graph theory)
0
0
0
Graph coloring
Defective coloring
0
0
0
Graph coloring
Distinguishing coloring
0
0
0
Graph coloring
Earth–Moon problem
0
0
0
Graph coloring
Edge coloring
0
0
0
Graph coloring
Equitable coloring
0
0
0
Graph coloring
Erdős–Faber–Lovász conjecture
0
0
0
Graph coloring
Exact coloring
0
0
0
Graph coloring
Five color theorem
0
0
0
Graph coloring
Four color theorem
0
0
0
Graph coloring
Fractional coloring
0
0
0
Graph coloring
Gallai–Hasse–Roy–Vitaver theorem
0
0
0
Graph coloring
Goldberg–Seymour conjecture
0
0
0
Graph coloring
Graph coloring game
0
0
0
Graph coloring
Greedy coloring
0
0
0
Graph coloring
Grundy number
0
0
0
Graph coloring
Grötzsch's theorem
0
0
0
Graph coloring
Gyárfás–Sumner conjecture
0
0
0
Graph coloring
Hadwiger conjecture (graph theory)
0
0
0
Graph coloring
Hadwiger–Nelson problem
0
0
0
Graph coloring
Hajós construction
0
0
0
Graph coloring
Hamiltonian coloring
0
0
0
Graph coloring
Harmonious coloring
0
0
0
Graph coloring
Heawood conjecture
0
0
0
Graph coloring
Heawood number
0
0
0
Graph coloring
Hedetniemi's conjecture
0
0
0
Graph coloring
Incidence coloring
0
0
0
Graph coloring
Interval chromatic number of an ordered graph
0
0
0
Graph coloring
Interval edge coloring
0
0
0
Graph coloring
Kempe chain
0
0
0
Graph coloring
L(2,1)-coloring
0
0
0
Graph coloring
L(h, k)-coloring
0
0
0
Graph coloring
List coloring
0
0
0
Graph coloring
List edge-coloring
0
0
0
Graph coloring
Monochromatic triangle
0
0
0
Graph coloring
Open coloring axiom
0
0
0
Graph coloring
Oriented coloring
0
0
0
Graph coloring
Path coloring
0
0
0
Graph coloring
Perfectly orderable graph
0
0
0
Graph coloring
Precoloring extension
0
0
0
Graph coloring
Rainbow coloring
0
0
0
Graph coloring
Rainbow matching
0
0
0
Graph coloring
Shift graph
0
0
0
Graph coloring
Star coloring
0
0
0
Graph coloring
Strong coloring
0
0
0
Graph coloring
Subcoloring
0
0
0
Graph coloring
Sum coloring
0
0
0
Graph coloring
Symmetric hypergraph theorem
0
0
0
Graph coloring
T-coloring
0
0
0
Graph coloring
Total coloring
0
0
0
Graph coloring
Tree-depth
0
0
0
Graph coloring
Tricolorability
0
0
0
Graph coloring
Uniquely colorable graph
0
0
0
Graph coloring
Vizing's theorem
0
0
0
Graph coloring
Well-colored graph
0
0
0
Graph coloring
Χ-bounded
0
0
0
Graph coloring
Graph cut optimization
0
0
0
Computational problems in graph theory
Graph cuts in computer vision
0
0
0
Computational problems in graph theory
Graph matching
0
0
0
Computational problems in graph theory
Graph partition
0
0
0
Computational problems in graph theory
Graph realization problem
0
0
0
Computational problems in graph theory
Graph sandwich problem
0
0
0
Computational problems in graph theory
Hamiltonian cycle polynomial
0
0
0
Computational problems in graph theory
Hamiltonian path
0
0
0
Computational problems in graph theory
Hamiltonian path problem
0
0
0
Computational problems in graph theory
Independent set (graph theory)
0
0
0
Computational problems in graph theory
Induced subgraph isomorphism problem
0
0
0
Computational problems in graph theory
Instant Insanity
0
0
0
Computational problems in graph theory
Articles were limited to the first 100 out of 179 total.
Click here to view all children of
Computational mathematics
.
Ancestors
(3)
Fields of mathematics
Mathematics
Index
View article source
Discussion
(0)
Subscribe (1)
+
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
+
Create my own version
