$ ( < [ 1 2 3 4 5 A B C D E F G H I J K L M N O P Q R S T U V W Z


cycle packing
domination number
geodetic dominating set
labeling
ordering of a graph
spanning trees
weighted degree
1-2-3 Conjecture
1,2,3-Conjecture
1,2-Conjecture
1-dependence
1-factor
1-factor
1-hamiltonian
1-planar graph
(2,2)-domination number
2-dimensional manifolds
2-dipath L(2,1)-labeling
2-distance coloring
2-distance operator
2-domination
2-domination
2-domination number
2-domination number
2-factor
2-factor hamiltonian
2-factors
2-independence number
2-packing
2-step dominating set
2-step graph
3 dimensional rectangular blocks
3-chromatic triangle
3-coloring
3-connected planar graphs
3-kernel
3-quasi-transitive digraph
3-quasitransitive digraph
3-simplicial vertex
3-sun
3-transitive digraph
4-critical graph
4-regular graph
4-transitive digraph
5-cycles
abelian group
[a,b]-factor
absorbing set of vertices
achromatic numbers
A-cordial
acyclic coloring
acyclic colouring
acyclic disconnection
(a,d)-antimagic labeling
(a,d)-antimagic labeling
additive
additive and hereditary graph classes
additive hereditary class
additive hereditary graph property
additive hereditary properties
additive induced-hereditary property of graphs
additivity
(a,d)-face antimagic labeling
adjacency matrix
adjacent vertex distinguishing edge coloring
adjoint polynomial
adomatic number
(a,d)-vertex-antimagic total labeling
algebraic connectivity
algorithm
algorithms
algorithms on graphs
all sizes
alliance
alliances in graphs
α -valuation
α-domination
α-labeling
α-like labeling
amalgam
ample tournament
annihilation
anti-Gallai graphs
antimagic labeling
antipodal number
anti-Ramsey
anti-Ramsey number
approximation algorithm
arank number
arbitrarily vertex decomposable graphs
arbitrary path decomposition
arboreal hypergraph
arc reversal
arc-transitive
arithmetic labeling of a graph
arithmetical maximal set
asymptotics
A-trails
AutoGraphiX
automated conjecture making
automorphism group
automorphism groups
average degree
backbone coloring
bad function
balance
balanced edge-coloring
balanced sigraph
Barnette's Conjecture
barrier
basic minimal total dominating functions (BMTDFs)
basis number
b-balanced simplex
b-chromatic number
b-coloring
b-continuity
b-domatic number
benzenoid graph
betweenness
bfs
BFS-cons-tructible graph
binary matroid
binomial coefficients
binomial tree
bipartite
bipartite graph
bipartite graphs
bipartite tournament
bipartition
bi-placing
block
block closure
block graph
block-chain traceable graph
block-cutpoint tree
bondage number
bounded degree graphs
bounds
branch-and-bound
bridge
bridged graph
broadcast chromatic number
broken circuit
broken circuits
Broken-cycle Theorem
Burkard-Hammer condition
Burkard-Hammer graph
cactus
cactus graphs
cage
cancellation
cardinal product
Cartesian fixer
Cartesian multiplier
cartesian product
Cartesian product graphs
Cartesian product of cycles
Cartesian product of graphs
Cartesian products
Catalan number
categorical product
categorization of edges
cater- pillar
caterpillar
caterpillars
cayley graph
Cayley graphs
center
central graph
centroid
centrosymmetric matrix
channel assignment problem
characteristic polynomial
characterization
chemistry
χ-binding function
choice index
choice number
choice-perfect graph
chord
chordal graph
chordal graphs
chordless graph
chromatic characterization
chromatic equivalence class
chromatic index
chromatic number
chromatic parameters
chromatic polynomial
chromatic uniqueness
chromatically equivalent graphs
chromatically unique graphs
chromatically unique hypergraphs
chromatic-choosable graphs
Chvátal-Erdos condition
Chvátal-Erdös condition
Chvátal's Condition
circulant
circulant graph
Circulant tournament
circular arc graphs
circular coloring
circular colouring
circular (P,Q)-total chromatic number
circular-arc graphs
circumference
claw
claw-free
claw-free graphs
clique
clique covering
clique graph
clique irreducible graphs
clique minor
clique number
clique partition
clique tree
clique vertex irreducible graphs
closed k-stop distance
closed modular chromatic number
closed modular k-coloring
closed neighborhood
closure
cluster
(co-) reciprocal polynomials
cobondage number
coclique
cographic matroid
co-graphs
co-irredundance
color eigenvalues
color energy
color-bounded hypergraph
coloring
coloring
colorings
colorings of graphs and hypergraphs
colour set
colouring game
colouring graph
colouring number
colouring of edges in a cycle
colourings
combinatorial analysis
combinatorial games
combinatorial search
common monochromatic subgraph
compact graph
comparability graph
competition graphs
competition hypergraph
competition number
complement
complement of a graph
completability
complete bipartite graphs
complete digraph
complete equibipartite graph
complete graph
complete graphs
complete minor
complete multigraph
complete multipartite graph
complete multipartite graphs
complete subgraph
complete ternary trees
complete tripartite graphs
completely independent critical cliques
completeness
complex networks
complexity
complexity of algorithms
composite graphs
composition graph
computational analysis
computational complexity
conjunction of graphs
connected dominating set
Connected domination
connected domination number
connected forcing connected vertex detour number
connected global offensive k-alliance
connected matching
connected resolving partition
connected vertex detour number
connectivity
consecutive coloring
consistent sigraph
constant-weight
constructible graph
convex 3-polytope
convex combination of MTDFs
convex domination
convex geometries
convex geometry
convex hull
convex sets
convexity
cop
cordial graph
cordial labeling
core graphs
cost chromatic number
cost coloring
cost colouring
co-strongly perfect graphs
countable graphs
counting
covering
covering number
covering numbers
covering projection
critical
critical clique
critical graph
critical independent set
critical kernel-imperfect
critical vertex
critical-kernel-imperfect digraph
crossing nr
crossing number
cubic bridge graph
cubic graph
cut vertex
cut-edge
cuts
cut-vertex
cut-vertices
cycle
cycle basis
cycle coverings
cycle extendable
cycle extendable graph
cycle factor
cycle space
cycle-pancyclism
cycles
cyclic and linear radio k-labeling
cyclic chromatic number
cyclic colouring
cyclic permutation
cyclically 1-generated
cyclically 3-partite digraphs
cyclically k-partite
cyclomatic number
cylinder
d-cube
decomposability
decomposable graph
decomposable property of graphs
decomposition
decomposition of a complete bipartite graph
decomposition tree
defective coloring
defensive alliance
defining set
degeneracy
degenerate set
degree
degree and diameter of a graph
degree condition
degree sequence
degree sequences
degree sets
degree sum
degree sum
degree sum condition
degree/diameter problem
degree-magic graphs
degrees of vertices
Δ-matroids
depth first search
Desarguesian finite projective geometry
detection number
determinant of graph
determinants
detour
detour hull number
detour number
detour transversal
diameter
diameter of a graph
dichromatic nr
difference digraph
difference graph
differentiating-total domination
digraph
digraph factorial
digraphs
dilation
dipole
Dirac's family
direct product
direct product of graphs
directed cycle
directed graph
directed graphs
directed path
directed path graph
discharging
discharging method
discrete torus
disjoint paths
dismantlable graphs
distance
distance chromatic number
distance coloring
distance colouring
distance domination
distance domination number
distance graph
distance hereditary graph
distance in graphs
distance independent set
distance k-dominating function
distance k-domination
distance local connectivity
distance magic graph
distance matrix
distance set
distance spectral radius
distance-colored digraphs
distance-transitive graphs
distance-two coloring
distant chromatic number
distinguishable graph
distinguishing chromatic number
distinguishing coloring
distinguishing number
distributive lattice
divisibility
divisor graph
D-join
domatic number
dominated claw toes
dominating cycle
dominating function
Dominating set
dominating set
dominating sets
dominating subgraph
domination
domination digraph
domination graph
domination nr
domination number
domination parameters
dominator coloring
double domination
double domination number
double geodetic number
double geodetic set
double-critical conjecture
double-stars
doubly light vertex
doubly partial order
d-partite complete hypergraph
drawing
drawings
dual alliance
dual closure
dual-chordal graph
duality
dually compact closed class
duplication
D-vertex magic graph
dynamic programming
edge C4 graph
edge clique cover
edge coloring
edge coloured digraph
edge colouring
edge congestion
edge covering number
edge decomposition
edge decompositions
edge deleted graphs
edge deletion
edge detour basis
edge detour number
edge detour set
edge disjoint
edge dominating set
edge domination
edge geodetic number
edge independence number
edge label growth-rate
edge labeling
edge ranking
edge removal
edge rotation
edge subdivision
(edge, vertex)-geodetic set
edge weight
edge-chromatic critical graphs
edge-colored graph
edge-coloring
edge-coloured digraph
edge-colouring
edge-connectivity
edge-cuts
edge-magic labelling
edge-magic total labeling
edge-magic total labelling
edge-partition
edge-separator tree
edge-to-edge median
edge-to-vertex median
edge-weighting
efficient domination
eigenspaces
eigenvalue
eigenvalues
eigenvalues of a graph
element splitting operation
elimination ordering
embedding
embeddings
end-blocks
ends
energy
enhanced line graph
entire weighting
equitable coloring
Erdos jumping constant conjecture
Erdos problem
Erdos-Faber-Lovász conjecture
error-correcting codes
eulerian
Eulerian irregularity
Eulerian walks
Euler's formula
evasiveness
even factor
exact double domination
expandable tree
expansion
expansion procedures
expansion theorem
extendable
extended line graph
extremal graph
extremal graph theory
extremal graphs
extremal problem
extremal problems
extreme geodesic graph
extreme vertex
face colouring
face size
factor
factor of graph
factor-critical graph
factor-criticality
factorization
factors of the de Bruijn graph
fall coloring of graphs
fan graph
fault-tolerance
F-domination
feasible set
feedback function
felicitous labellings
FETI
Fibonacci
Fibonacci numbers
finite affine geometry
finite Euclidean graphs
finite projective geometry
flexible q-labeling
flower conjecture
Folkman numbers
forbidden graph
forbidden induced subgraph
forbidden subgraphs
forcing connected vertex detour number
forcing geodetic number
forcing Steiner number
forest and triangle-free graph
formal concept analysis
fractional chromatic number
fractional coloring
fractional distance k-domination
fractional domination
fractional domination number
fractional global domination number
fractional (P,Q)-total chromatic number
fragment
frequency assignment
Friendship Theorem
Frucht's theorem
full
full domination
full star domination
fullerene graph
functigraphs
function reducible graphs
function separable graphs
Gale-Shapley model
Gallai equality
Gallai graphs
Gallai multigraph
Gallai's Theorem
game
gamma graphs
gamma sets
γ-bad/good vertex
γ-cycle
γ-labeling
γ-labelings
gated subgraph
gatedness
g-cycle
genealogical tree
general model of a random digraph
generalised chromatic number
generalised inverse
generalised irredundance
generalized chromatic number
generalized claw-free graphs
generalized colouring
generalized colouring game
generalized colourings
generalized degree
generalized domination
generalized edge-chromatic number
generalized hypercube
generalized line graph
generalized prisms
generalized Ramsey theory
generalized total colorings
generalized-theta-graph
generating function
generating functions
generating sets
generation
genus
geodesic
geodesic graph
geodetic graph
geodetic number
geodetic set
geometric graphs
geometric labeling of a graph
geometric probability
geometry
girth
global alliance
global dominating function
global domination
global offensive k-alliance
global offensive k-alliance number
graceful graph
graceful labellings
graph
Graph algorithms
graph algorithms
graph automorphisms
graph bundles
graph center
graph coloring
graph colorings
graph colouring
graph composition
graph decomposition and factorization
graph decompositions
graph density
graph direct product
graph domination
graph dynamics
graph eigenvalues
graph embeddings
graph factorization
graph homomorphisms
graph invariants
graph isomorphism
graph labeling
graph labelling
graph linkages
graph metric
graph operations
graph operator
graph orientation
graph polynomials
graph product
graph product cancellation
graph products
graph properties
graph property
graph property of finite character
graph property with assignment
graph representation
graph tensor product
graph theory
graph transformation
graph with colouring number at most k+1
graph-decompositions
graphic matroid
graphs
graphs direct product
grid
grid graph
Grotzsch-Sachs graph
Grundy coloring
grundy function
Hadwiger conjecture
Hadwiger's Conjecture
Hajós' construction
half-convexity
halin graph
Halin graphs
hamilton cycle
hamilton cycles
Hamiltonian
hamiltonian
hamiltonian circuit
Hamiltonian coloring exponents
hamiltonian cycle
hamiltonian cycles
hamiltonian decomposition
hamiltonian graph
hamiltonian graphs
hamiltonian path
Hamiltonian-colored digraphs
Hamiltonian-connected
hamiltonicity and circumference
Harary index
harmonious labeling
harmonious labellings
heavy subgraph
Helly graph
Helly number
Helm graphs
hereditary
hereditary class of graphs
hereditary classes
hereditary clique-Helly graph
hereditary graph property
hereditary properties
hereditary property
hereditary property of graphs
heterochromatic number
heterochromatic triangle
hexagonal grid
hexagonal lattice of the plane
hexagonal tiling
highly irregular property
history
hitting times
homomorphism
homomorphism duality
hom-property of graphs
Hosoya index
host graph
hull
hull number
hypercube
hypercubes
hypercycle
hypergraph
hypergraph colourings
hypergraph convexity
hypergraphs
hypertrees
hyper-Wiener index of a graph
identifiable graph
identifying code
idomatic number
IE-total coloring
incidence coloring
incomplete latin rectangle
indecomposable
independence
independence nr
independence number
independent domination
independent domination nr
independent Roman domination
independent set
independent set of vertices
independent sets
independent transversal dominating set
index of a graph
induced matchings
induced paired-domination
Induced paths
induced subgraphs
induced-hereditary
induced-hereditary properties
induced-hereditary property of graphs
induction
inequality
infinite digraph
infinite graph
injective hull
inner vertex number
integer distance graph
interconnection network
interference
intersecting family
intersection graph
intersection hypergraph
intersection matrix
intersection number of a hypergraph
interval
interval coloring
interval graph
interval orders
<i>p</i>-Wiener free interval
irreducible property
irredundance
irredundance number
irregular digraphs
irregular edge-coloring
irregularity of graphs
irregularity strength
Ising model
isometric embeddings
isometric graph
isometric subgraph
isomorphic factors
isomorphism
{ E, net}-free graphs
iterated line graph
Johnson graph
join in the lattice
join product
jump distance
jump distance graph
kaleidoscopic pseudo-randomness
k-ary n-cubes
k-connected
k-core
k-covering
k-degenerate graph
k-distance Roman dominating function
k-distance Roman domination number
k-ended tree
kernel
kernel by monochromatic paths
kernel of digraph
kernel-perfect
kernel-perfect digraph
k-factors
k-fun
k-independence
k-independence stable graphs
k-independent
k-independent set
k-intersection edge colouring
kite graph
k-kernel
k-kernel
KKM covering
(k,l)-kernel
(k,l)-kernel
k-middle digraph
k-monophonic convexity
Kneser graph
kneser graph
Kn-free graphs
Koester graph
k-packing
k-partite
k-partite graph
k-planar graph
Kp-saturated graphs
k-quasi-transitive digraph
k-quasi-transitive digraph
k-rainbow domatic number
k-rainbow dominating function
k-rainbow domination number
kronecker product
k-subdivision digraph
k-total digraph
k-transitive digraph
k-transversal number
k-tree
k-trees
k-trestle
k-tuple domination
k-tuple domination number
(k-tuple total domination) number
k-uniform hypergraph
labelling
Laborde-Payan-Xuong Conjecture
ladder graph
Lagrangian
(λ,μ)-graph
(λ,μ)-tree
Laplacian eigenvalues
Laplacian matrix
largest Laplacian eigenvalue
lattice
lattice of additive hereditary graph properties
lattice of properties of graphs
lattices
(L,d)*-coloring
l-dominating set
leafage
leap
leap operation
least eigenvalue of a graph
leaves
Lebesgue theorem
Lee's conjecture
left-pretransitive digraph
lexicographic product
light edge
light graph
light subgraph
light subgraphs
limit cardinal number
line digraph
line graph
line graphs
linear arboricity
linear edge geodetic set
linear forest
list coloring
list improper coloring
list linear arboricity
list total colouring
list-coloring
local coloring
local matching conditions
locally disconnected
locally reducible factor
locally reducible function
locally semicomplete
locally transitive
locating-domination number
locating-total dominating set
locating-total domination
long cycle
(long, optimal, Hamilton) cycle
longest cycle
longest path
longest paths
Lucas numbers
magic and sequential graphs
magic constant
magic graphs
magic labeling
majority
matching
matching extension
matching number
matching polynomial
matching-covered graph
matrix graphic
matroid intersection
matroids
maximal common monochromatic subgraph
maximal common subgraph
maximal graph
maximal graphs
maximal hypergraphs
maximal independent sets
maximal Kp-free graphs
maximal nonhamiltonian split graph
maximal partial clones
maximum average degree
maximum degree
maximum length cycle
maximum signed matching
m-coloured bipartite tournaments
m-coloured digraph
m-coloured digraph
m-coloured quasi-transitive digraph
(m,d)*-choosable
mean coloring
median
median graph
median graphs
Menger
metric
middle graph
minimal basis
minimal forbidden graph family
minimal forbidden subgraph family
minimal paths
minimal rankings
minimal reducible bounds
minimal size
minimal total dominating functions (MTDFs)
minimal trees
minimally 2-connected graph
minimally 3-connected
minimum congestion spanning tree
minimum degree
minimum degree two
minimum length basis
minimum vertex degree
min-max theorems
minor
minor hereditary property
minor-free graph
mixed graph
mixed hypergraphs
modular edge-graceful labelings and graphs
modular edge-gracefulness
modular graph
mold
monochromatic cycles
monochromatic path digraph
monochromatic Ramsey number
monocore graph
monophonic intervals of sets
monophonic number
monophonic path
MOP
multidigraph
multigraph
multigraphs
multilevel distance labeling
multilinear function
multipartite graphs
multipartite tournaments
multiple domination
multiplicative labelling
multiset coloring
multivalued mapping
Mycielski graph
Mycielskian
n-arity
n-dimensional cube
near polynomial growth
nearly antipodal chromatic number
negative decision number
neighbor
neighbor-connectivity bound
neighbor-distinguishing coloring
neighborhood
neighborhood closure
neighborhood color set
neighborhood completeness number
neighborhood graph
neighborhood unions and intersections
net-regular signed graphs
networks
niche graphs
node congestion
non-augmentable path
non-fall colorable graphs
non-Hamiltonian
non-Hamiltonian graph
non-selfcentric
nonuniform hypergraph
Nordhaus-Gaddum
Nordhaus-Gaddum results
Nordhaus-Gaddum type result
normal Cayley graph
normal map
normal planar map
nowhere-zero labelings
np-complete
NP-complete problems
np-completeness
np-hard
number of spanning trees
object-system
octahedrite
ODC
odd dominating set
odd girth
offensive
offensive alliance
Ohba's conjecture
one-factor
on-line algorithm
online Ramsey games
on-line vertex colouring
open geodetic number
open packing
optimal vector
optimization
ordered colouring
Ore-type condition
orgraph
orientation
oriented chromatic number
oriented coloring
oriented colouring
oriented graph
oriented L(2,1)-labeling
oriented tree
orthogonal double cover
outerplanar graph
outerplanar graph.
P6-free graphs
packing
packing graph
packing number
packing of digraphs
packing of graphs
packings of graphs
Padovan numbers
paired domination
paired-domination
pancyclic
pancyclic graph
pancyclic graphs
pancyclic matroid
pancyclism
parallel computing
parity coloring
parity colouring
parity domination
parity partition
partial cubes
partial Hamming graph
partial k-tree
partially square graph
partioned domination
partition
partition of a graph
partition problems
path
path decomposition
path embeddings
path factor
path graph
Path Kernel Conjecture
Path Partition Conjecture
path-distance-width
path-graph
path-induced convexity
path-like tree
path-neighborhood graph
paths
paths and cycles
P-colouring
p-domination number
pendant path
pentagons
perfect 2-matching
perfect connected-dominant graph
perfect dominating set
perfect dominating sets
perfect edge geodetic set
perfect graphs
perfect matching
perfect matchings
perfect neighbourhoods
peripheral expansion.
periphery
permanent
permanental polynomial
permanental roots
permutation
permutation graph
permutation graphs
persistency
petersen graph
phylogeny graph
Pisot numbers
placement
planar
Planar graph
planar graph
planar graphs
plane elementary bipartite graph
plane graph
plane map
plane triangulation
plick graph
point-distinguishing chromatic index
Poisson convergence
polyhedral graphs
polyhedral maps
polyhedron
polynomial algorithms
polynomial time
polynomial-time algorithm
polytopal graphs
polytope
potential number
power and complement of a graph
power of a graph
power of tree
power sums
powers of a graph
powers of a strong oriented graph
(P,Q)-total (a,b)-list colorings
(P,Q)-total coloring
precoloring extension
prescribed vertices
pretransitive digraph
prime factor theorem
prime ideals
primoid
principal eigenvector
prism and web graph
prism doubler
prism fixer
prism graphs
prism of a graph
prismatic colouring
prisms of graphs
probabilistic method
product
product graph
products
products of graphs
projective plane
proper colouring
property
property Δ*
property Δ+
Property of graphs
pseudomanifold
Ptolemaic graph
pursuit
q-analog
q-distance matrix
quadrangle-free graphs
quadrangulation
quasigroup
quasi-matching
quasi-median graph
quasi-monochromatic digraph
quasiperfect dominating set
quasi-randomness
quasi-transitive digraph
queens domination problem
queens graph
radial graph
radially-maximal
radio channel assignment
radio channel frequency assignment
radio colorings
radio k-chromatic number
radio k-coloring
radio k-labeling
radio labeling
radio number
radius
radius of graph
Radon number
rainbow coloring
rainbow colouring
rainbow connection
rainbow connection number
rainbow connectivity
rainbow dominating function
rainbow domination number
rainbow index
rainbow number
rainbow tree
rainbow vertex-connection
rainbow-coloring
rainbow-connected graph
rainbow-tree
Ramsey class
Ramsey minimal graph
Ramsey numbers
Ramsey theory
Ramsey-minimal graphs
random digraphs
random graph
random graphs
random interval graphs
random matroids
random procedure
rank
rank number
ranking number
rankings of graphs
r-ciliate
recognition number
recognizable coloring
reconstruction
reconstruction problem
reducibility
reducibility.
reducible configuration
reducible face
reducible graph properties
reducible property
reducible property of graphs
reduction
regular graph
regular graphs
regular tournament
relevant circuits
remainder
representation of a graph
resolving partition
restrained domination
restrained domination number
right-pretransitive digraph
Roman bondage number
Roman dominating function
Roman domination
Roman domination number
Rook's graph
rotation distance
saturated graph
saturated graphs
saturated vertex
saturation
secure domination
secure total domination
segregated labelings
selfcomplementary graphs
self-complementary hypergraph
self-complementing permutation
self-orthogonal factorization
semikernel
semikernel of D modulo i by monochromatic paths
semi-matching
semi-total line sigraph
semi-total point sigraph
separating set
sequential labelling
set chromatic number
set coloring
set systems
shadow
sharp upper bounds
short cycle
shortest path
shortness exponent
Sidon sequence
signed 2-independence function
signed 2-independence number
signed domatic number
signed dominating function
signed domination number
signed edge cover
signed edge cover number
signed graph
signed matching
signed matching number
signless Laplacian
signless Laplacian matrix
signpost system
sigraph
simplex
simplex of a graph
simplex operator
simplicial clique
simplicial complex
simply (k-)sequentially additive labelings (graphs)
sirth
size Ramsey number
snake
snark
solution of digraph
solution space enumeration
spaning tree
spanning graph
spanning subgraph
spanning tree
spanning tree congestion
spanning trees
sparse graphs
special super edge-magic labeling
spectral integral variation
spectral radius
spectral radius
spectrum
Sperner lemma
sphere of influence graph
split domination number
split graph
split graphs
splitting operation
square
s-regular Cayley graph
stability
stability number
stable graph
stable graphs
stable matching
stable perfect matching
stable set
stable sets
star
star coloring
star factor
star partitions
star-cycle factor
star-like trees
stars
state splitting
Steiner convexity
Steiner distance
Steiner number
stratified graph
stretch number
strip
strong chromatic index
strong circular P-chromatic number
strong digraph
strong edge-coloring
strong equality
strong matching
strong parity vertex colouring
strong p-Helly graph
strong product
strong rainbow connection
strongly chordal graphs
strongly independent set
strongly multiplicative graphs.
strongly perfect graphs
strongly polynomial-time
structural characterization
structure
structured parallel compute
subcubic graph
subcubic graphs
subdivision
subdivision
subdivision numbers
subgraph
subgraph identification
submultiplicative
subtree intersection representation
sum hypergraphs
sum number
sunflower hypergraph
super edge-antimagic labeling
super edge-magic labeling
superior edge geodetic set
supermagic graphs
super-magic labeling
supermultiplicative
surface
surplus
switching classes
symmetric dominating set
symmetric graphs
symmetric Hamilton cycle
tame mold
tandem-win
T-distance
tensor products
T-factorization
T-geodesic
the color-class digraph
the de Bruijn graph
the fourth character
the second smallest real root
the smallest real root
the X-join of graphs
theta graph
θ1-perfect graphs
threshold graph
threshold graphs
thresholds
tight hypergraphs
tight tournament
toroidal chessboards
toroidal grid
torus
total assignment
total choice number
total choosability
total chromatic number
total coloring
total covering
total dominating set
total domination
total domination number
total domination subdivision number
total edge irregularity strength
total graph
total graphs
total irredundance
total irregularity of graphs
total {k}-domatic number
total {k}-dominating function
total k-domination
total {k}-domination number
total k-subdomination
total labellings
total outer-connected domination number
total restrained domination number
total vertex irregularity strength
totally multicoloured
toughness
tour girth
tournament
tournaments
T-path
Tp-tree
traceability
traceable
traceable graphs
trail
transfer matrix method
transit function
transitive digraph
transitive digraph,
transitive graphs
transitive tournament
transversal set
traveling salesman problem
travelling salesman problem
travers-ability
tree
tree graph
tree packing
trees
triangle avoidance game
triangle-free graph
triangle-free graphs
triangular lattice
triangulated surface
triangulation
triple systems
trivially perfect graph
Tutte polynomial
twin subsets
two paths problem
two-factor
two-point concentration
type of a face
unavoidable set
underlying graph
undirected graph
unicyclic graph
unicyclic graphs
uniform hypergraph
unique colorability
unique factorization
unique k-factor
uniquely 3-list colorable graph
uniquely embeddable graphs
uniquely H-colourable
uniquely partitionable graphs
uniquely partitionable planar graphs
uniquely partitionable system
universal graphs
universal part
upper bound
upper chromatic number
upper connected vertex detour number
upper domination Ramsey number.
upper geodetic number
upper locating-domination number
upper paired domination
upper total domination
upset tournament
value of a γ-labeling
variety
vertex 3-colouring
vertex coloring
vertex colouring
vertex connectivity
vertex cover
vertex degree
vertex detour number
vertex disjoint copy
vertex irregular total k-labeling
vertex irregular total labeling
vertex labeling
vertex labelling
vertex monophonic number
vertex partition
vertex partition number
vertex PI index
vertex ranking
vertex removal critical graphs
vertex removal stable graphs.
vertex stable graph
vertex-critical
vertex-disjoint copies
vertex-disjoint cycle
vertex-distinguishing edge-coloring
vertex-distinguishing IE-total chromatic number
vertex-distinguishing IE-total coloring
vertex-dominating cycle
vertex-magic total labeling
vertex-symmetric directed graph
vertex-symmetric graph
vertex-to-edge median
vertex-weighting
Vizing's conjecture
Vizing`s conjecture
walk double cover
weak Cartesian product
weak dual
weak parity vertex colouring
weak Roman domination number
weak saturation
weak-extreme vertex
weakly connected domination number
weakly connected domination subdivision number
weakly convex domination number
weakly geodetic graph
weakly saturated graphs
weakly universal graph
weakly-modular graph
weak-retract
weight
weight of a graph
weight of a path
weight of an edge
weight of path
weighted degree
weighted dgph
weighted graph
well-covered
well-covered dimension
well-spread sequence
wheel
wheels
Wiener distance
Wiener graphical
Wiener index
Wiener index of a graph
Wiener number
wreath product
x-detour hull number
x-detour number
Zagreb indices
Zykov sums