Category:Graph theory

c

• [+] cmn:Graph theory (0)
• [+] cs:Graph theory (0)

f

• [+] fi:Graph theory (0)
• [+] fr:Graph theory (0)

h

• [+] hr:Graph theory (0)

i

• [+] it:Graph theory (0)

j

• [+] ja:Graph theory (0)

s

• [+] sh:Graph theory (0)

s cont.

• [+] sv:Graph theory (0)

z

• [+] zh:Graph theory (2)

*

• graph theory

A

• Appendix:Glossary of graph theory

H

• Hamiltonian cycle
• Hamiltonian graph
• Hamiltonian path

T

• Tutte matrix

a

• acyclic
• arc
• arrow

b

• bipartite
• bridge
• bridgeless

c

• caterpillar tree
• cherry
• choosability
• chromatic number
• clique
• coclique
• complete graph
• connected
• connected component
• connected graph
• covering number
• cycle

d

• degree

d cont.

• diameter
• digraph
• directed
• directed edge
• directed graph
• directed path
• disperser
• dominating set
• domination number

e

• edge
• edge cover
• edge covering number
• empty graph
• extractor

f

• forest

g

• graph

h

• hyperedge
• hypervertex
• hypohamiltonian
• hypotraceable

i

• incidence matrix
• indegree
• independence number
• independent set

l

• line

l cont.

• loop

m

• matching
• matching number
• multigraph

n

• node
• noneven

o

• order
• outdegree

p

• path length
• planar
• polytree
• pseudoforest
• pseudograph

r

• root

s

• size
• strongly connected
• strongly connected component

t

• tree

u

• undirected graph
• undirected path

v

• valency
• vertex
• vertex cover