Related articles:
Bipartite graph
Graph (mathematics)
Graph theory
Hamiltonian path
Planar graph
Polyhedron
Key terms:
acyclic
adjacent vertices
bipartite graph
clique
connected graph
diam
digraph
directed acyclic
disconnecting
disconnecting set
disjoint
dominates another vertex
edges
edges are rendered
empty graph
eulerian
every vertex
graph
graph theory
hamiltonian path
if every vertex
induced subgraph
internally disjoint
isolated vertex
multiple edges
pairwise
planar graph
reachable
reachable from every other
same vertex set
simplicial
spanning subgraph
spanning tree
starting and ending nodes
strongly connected component
subgraph
undirected
undirected edges
undirected graph
unweighted
vertex
vertex is reachable from every
vertex set
vertex subset
vertices
vertices and edges
vertices are adjacent
weighted graph
when stated without any qualification
whose removal disconnects
Search external links cited by footnotes on Wikipedia page Glossary of graph theory:
|
|