Related terms:
matching polynomial
finite graph
eulerian cycle
vertex of degree
oplus w
independent dominating
edge cover
minimum edge
maximal matching
dynkin
augmenting path
efficient algorithm
bipartite matching
unmatched
maximum matching
adjacent vertices
any graph
v e
odd degree
set cover
finite type
induced subgraph
cycle graph
set cover problem
perfect matching
connected component
each edge
exactly once
Wikipedia sources:
Neighbourhood (graph theory)
Dominating set
Eulerian path
Degeneracy (graph theory)
Matching (graph theory)
Quiver (mathematics)
Context for words:
all
vertices
|
|