0 |

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$-factors |

2-factor hamiltonian |

$2$-independence number |

2-packing |

2-step dominating set |

2-step graph |

$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 |

3 dimensional rectangular blocks |

4-critical graph |

4-regular graph |

4-transitive digraph |

5-cycles |

[a,b]-factor |

(a,d)-antimagic labeling |

$(a,d)$-antimagic labeling |

$(a,d)$-face antimagic labeling |

(a,d)-vertex-antimagic total labeling |

$\alpha$-domination |

$\alpha$-labeling |

$\alpha$-like labeling |

$\alpha $-valuation |

$\chi$-binding function |

(co-) reciprocal polynomials |

$\Delta$-matroids |

(edge, vertex)-geodetic set |

$\gamma$-bad/good vertex |

$\gamma$-cycle |

$\gamma$-labeling |

$\gamma$-labelings |

*p*-Wiener free interval |

$\{${\it E, net}$\}$-free graphs |

(k,l)-kernel |

$(k,l)$-kernel |

($k$-tuple total domination) number |

$(\lambda,\mu)$-graph |

$(\lambda,\mu)$-tree |

$(L,d)^{*}$-coloring |

(long, optimal, Hamilton) cycle |

$(m,d)^{*}$-choosable |

(P,Q)-total (a,b)-list colorings |

(P,Q)-total coloring |

$\theta_1$-perfect graphs |

A |

abelian group |

absorbing set of vertices |

achromatic numbers |

$A$-cordial |

acyclic coloring |

acyclic colouring |

acyclic disconnection |

additive |

additive and hereditary graph classes |

additive hereditary class |

additive hereditary graph property |

additive hereditary properties |

additive induced-hereditary property of graphs |

additivity |

adjacency matrix |

adjacent vertex distinguishing edge coloring |

adjoint polynomial |

adomatic number |

algebraic connectivity |

algorithm |

algorithms |

algorithms on graphs |

alliance |

alliances in graphs |

all sizes |

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-transitive |

arc reversal |

arithmetical maximal set |

arithmetic labeling of a graph |

asymptotics |

A-trails |

AutoGraphiX |

automated conjecture making |

automorphism group |

automorphism groups |

average degree |

B |

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-chain traceable graph |

block-cutpoint tree |

block closure |

block graph |

bondage number |

bounded degree graphs |

bounds |

branch-and-bound |

bridge |

bridged graph |

broadcast chromatic number |

Broken-cycle Theorem |

broken circuit |

broken circuits |

Burkard-Hammer condition |

Burkard-Hammer graph |

C |

cactus |

cactus graphs |

cage |

cancellation |

cardinal product |

Cartesian fixer |

Cartesian multiplier |

cartesian product |

Cartesian products |

Cartesian product graphs |

Cartesian product of cycles |

Cartesian product of graphs |

Catalan number |

categorical product |

categorization of edges |

caterpillar |

caterpillars |

cater- pillar |

cayley graph |

Cayley graphs |

center |

central graph |

centroid |

centrosymmetric matrix |

channel assignment problem |

characteristic polynomial |

characterization |

chemistry |

choice-perfect graph |

choice index |

choice number |

chord |

chordal graph |

chordal graphs |

chordless graph |

chromatically equivalent graphs |

chromatically unique graphs |

chromatically unique hypergraphs |

chromatic-choosable graphs |

chromatic characterization |

chromatic equivalence class |

chromatic index |

chromatic number |

chromatic parameters |

chromatic polynomial |

chromatic uniqueness |

Chvátal-Erdos condition |

Chvátal-Erdös condition |

Chvátal's Condition |

circulant |

circulant graph |

Circulant tournament |

circular-arc graphs |

circular arc graphs |

circular coloring |

circular colouring |

circular (P,Q)-total chromatic number |

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 |

cobondage number |

coclique |

cographic matroid |

co-graphs |

co-irredundance |

color-bounded hypergraph |

coloring |

colorings |

colorings of graphs and hypergraphs |

coloring |

color eigenvalues |

color energy |

colourings |

colouring game |

colouring graph |

colouring number |

colouring of edges in a cycle |

colour set |

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 |

completely independent critical cliques |

completeness |

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 |

complexity |

complexity of algorithms |

complex networks |

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 |

convexity |

convex 3-polytope |

convex combination of MTDFs |

convex domination |

convex geometries |

convex geometry |

convex hull |

convex sets |

cop |

cordial graph |

cordial labeling |

core graphs |

co-strongly perfect graphs |

cost chromatic number |

cost coloring |

cost colouring |

countable graphs |

counting |

covering |

covering number |

covering numbers |

covering projection |

critical |

critical-kernel-imperfect digraph |

critical clique |

critical graph |

critical independent set |

critical kernel-imperfect |

critical vertex |

crossing nr |

crossing number |

cubic bridge graph |

cubic graph |

cut-edge |

cuts |

cut-vertex |

cut-vertices |

cut vertex |

cycle |

cycle-pancyclism |

cycles |

cycle basis |

cycle coverings |

cycle extendable |

cycle extendable graph |

cycle factor |

cycle packing |

cycle space |

cyclically 1-generated |

cyclically $3$-partite digraphs |

cyclically $k$-partite |

cyclic and linear radio k-labeling |

cyclic chromatic number |

cyclic colouring |

cyclic permutation |

cyclomatic number |

cylinder |

D |

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/diameter problem |

degree-magic graphs |

degrees of vertices |

degree and diameter of a graph |

degree condition |

degree sequence |

degree sequences |

degree sets |

degree sum |

degree sum |

degree sum condition |

depth first search |

Desarguesian finite projective geometry |

detection number |

determinants |

determinant of graph |

detour |

detour hull number |

detour number |

detour transversal |

diameter |

diameter of a graph |

dichromatic nr |

difference digraph |

difference graph |

differentiating-total domination |

digraph |

digraphs |

digraph factorial |

dilation |

dipole |

Dirac's family |

directed cycle |

directed graph |

directed graphs |

directed path |

directed path graph |

direct product |

direct product of graphs |

discharging |

discharging method |

discrete torus |

disjoint paths |

dismantlable graphs |

distance |

distance-colored digraphs |

distance-transitive graphs |

distance-two coloring |

distance chromatic number |

distance coloring |

distance colouring |

distance domination |

distance domination number |

distance graph |

distance hereditary graph |

distance independent set |

distance in graphs |

distance $k$-dominating function |

distance $k$-domination |

distance local connectivity |

distance magic graph |

distance matrix |

distance set |

distance spectral radius |

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 number |

domination parameters |

dominator coloring |

double-critical conjecture |

double-stars |

double domination |

double domination number |

double geodetic number |

double geodetic set |

doubly light vertex |

doubly partial order |

d-partite complete hypergraph |

drawing |

drawings |

dual-chordal graph |

duality |

dually compact closed class |

dual alliance |

dual closure |

duplication |

$D$-vertex magic graph |

dynamic programming |

E |

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 |

edge $C_4$ 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 labeling |

edge label growth-rate |

edge ranking |

edge removal |

edge rotation |

edge subdivision |

edge weight |

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-Faber-Lovász conjecture |

Erdos jumping constant conjecture |

Erdos problem |

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 graphs |

extremal graph theory |

extremal problem |

extremal problems |

extreme geodesic graph |

extreme vertex |

F |

face colouring |

face size |

factor |

factor-criticality |

factor-critical graph |

factorization |

factors of the de Bruijn graph |

factor of 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 |

fullerene graph |

full domination |

full star domination |

functigraphs |

function reducible graphs |

function separable graphs |

G |

Gale-Shapley model |

Gallai's Theorem |

Gallai equality |

Gallai graphs |

Gallai multigraph |

game |

gamma graphs |

gamma sets |

gatedness |

gated subgraph |

g-cycle |

genealogical tree |

generalised chromatic number |

generalised inverse |

generalised irredundance |

generalized-theta-graph |

generalized chromatic number |

generalized claw-free graphs |

generalized colouring |

generalized colourings |

generalized colouring game |

generalized degree |

generalized domination |

generalized edge-chromatic number |

generalized hypercube |

generalized line graph |

generalized prisms |

generalized Ramsey theory |

generalized total colorings |

general model of a random digraph |

generating function |

generating functions |

generating sets |

generation |

genus |

geodesic |

geodesic graph |

geodetic dominating set |

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-decompositions |

graphic matroid |

graphs |

graphs direct product |

graph algorithms |

Graph algorithms |

graph automorphisms |

graph bundles |

graph center |

graph coloring |

graph colorings |

graph colouring |

graph composition |

graph decompositions |

graph decomposition and factorization |

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 products |

graph product cancellation |

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 |

grid |

grid graph |

Grotzsch-Sachs graph |

Grundy coloring |

grundy function |

Hadwiger's Conjecture |

Hadwiger conjecture |

Hajós' construction |

half-convexity |

halin graph |

Halin graphs |

hamiltonian |

Hamiltonian |

Hamiltonian-colored digraphs |

Hamiltonian-connected |

hamiltonian circuit |

Hamiltonian coloring exponents |

hamiltonian cycle |

hamiltonian cycles |

hamiltonian decomposition |

hamiltonian graph |

hamiltonian graphs |

hamiltonian path |

hamiltonicity and circumference |

hamilton cycle |

hamilton cycles |

Harary index |

harmonious labeling |

harmonious labellings |

heavy subgraph |

Helly graph |

Helly number |

Helm graphs |

hereditary |

hereditary classes |

hereditary class of graphs |

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 |

hypergraphs |

hypergraph colourings |

hypergraph convexity |

hypertrees |

hyper-Wiener index of a graph |

I |

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 sets |

independent set of vertices |

independent transversal dominating set |

index of a graph |

induced-hereditary |

induced-hereditary properties |

induced-hereditary property of graphs |

induced matchings |

induced paired-domination |

Induced paths |

induced subgraphs |

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 |

irreducible property |

irredundance |

irredundance number |

irregularity of graphs |

irregularity strength |

irregular digraphs |

irregular edge-coloring |

Ising model |

isometric embeddings |

isometric graph |

isometric subgraph |

isomorphic factors |

isomorphism |

iterated line graph |

J |

Johnson graph |

join in the lattice |

join product |

jump distance |

jump distance graph |

K |

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-perfect |

kernel-perfect digraph |

kernel by monochromatic paths |

kernel of 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-middle digraph |

$k$-monophonic convexity |

kneser graph |

Kneser graph |

K_n-free graphs |

Koester graph |

$k$-packing |

$k$-partite |

k-partite graph |

k-planar graph |

$K_p$-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-uniform hypergraph |

L |

labeling |

labelling |

Laborde-Payan-Xuong Conjecture |

ladder graph |

Lagrangian |

Laplacian eigenvalues |

Laplacian matrix |

largest Laplacian eigenvalue |

lattice |

lattices |

lattice of additive hereditary graph properties |

lattice of properties of graphs |

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 |

linear arboricity |

linear edge geodetic set |

linear forest |

line digraph |

line graph |

line graphs |

list-coloring |

list coloring |

list improper coloring |

list linear arboricity |

list total colouring |

locally disconnected |

locally reducible factor |

locally reducible function |

locally semicomplete |

locally transitive |

local coloring |

local matching conditions |

locating-domination number |

locating-total dominating set |

locating-total domination |

longest cycle |

longest path |

longest paths |

long cycle |

Lucas numbers |

M |

magic and sequential graphs |

magic constant |

magic graphs |

magic labeling |

majority |

matching |

matching-covered graph |

matching extension |

matching number |

matching polynomial |

matrix graphic |

matroids |

matroid intersection |

maximal common monochromatic subgraph |

maximal common subgraph |

maximal graph |

maximal graphs |

maximal hypergraphs |

maximal independent sets |

maximal $K_p$-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 |

mean coloring |

median |

median graph |

median graphs |

Menger |

metric |

middle graph |

minimally $2$-connected graph |

minimally 3-connected |

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 |

minimum congestion spanning tree |

minimum degree |

minimum degree two |

minimum length basis |

minimum vertex degree |

min-max theorems |

minor |

minor-free graph |

minor hereditary property |

mixed graph |

mixed hypergraphs |

modular edge-gracefulness |

modular edge-graceful labelings and graphs |

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 |

Mycielskian |

Mycielski graph |

N |

n-arity |

$n$-dimensional cube |

nearly antipodal chromatic number |

near polynomial growth |

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-completeness |

NP-complete problems |

np-hard |

number of spanning trees |

O |

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 |

ordering of a graph |

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. |

P |

$P_6$-free graphs |

packing |

packings of graphs |

packing graph |

packing number |

packing of digraphs |

packing 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 |

partially square graph |

partial cubes |

partial Hamming graph |

partial $k$-tree |

partioned domination |

partition |

partition of a graph |

partition problems |

path |

path-distance-width |

path-graph |

path-induced convexity |

path-like tree |

path-neighborhood graph |

paths |

paths and cycles |

path decomposition |

path embeddings |

path factor |

path graph |

Path Kernel Conjecture |

Path Partition Conjecture |

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-time algorithm |

polynomial algorithms |

polynomial time |

polytopal graphs |

polytope |

potential number |

powers of a graph |

powers of a strong oriented graph |

power and complement of a graph |

power of a graph |

power of tree |

power sums |

precoloring extension |

prescribed vertices |

pretransitive digraph |

prime factor theorem |

prime ideals |

primoid |

principal eigenvector |

prismatic colouring |

prisms of graphs |

prism and web graph |

prism doubler |

prism fixer |

prism graphs |

prism of a graph |

probabilistic method |

product |

products |

products of graphs |

product graph |

projective plane |

property |

property $\Delta^*$ |

property $\Delta^+$ |

Property of graphs |

proper colouring |

pseudomanifold |

Ptolemaic graph |

pursuit |

Q |

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 |

R |

radially-maximal |

radial graph |

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-connected graph |

rainbow-tree |

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 |

Ramsey-minimal graphs |

Ramsey class |

Ramsey minimal graph |

Ramsey numbers |

Ramsey theory |

random digraphs |

random graph |

random graphs |

random interval graphs |

random matroids |

random procedure |

rank |

rankings of graphs |

ranking number |

rank number |

$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 |

S |

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 |

shortest path |

shortness exponent |

short cycle |

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 trees |

spanning trees |

spanning tree congestion |

sparse graphs |

special super edge-magic labeling |

spectral integral variation |

spectral radius |

spectral radius |

spectrum |

Sperner lemma |

sphere of influence graph |

splitting operation |

split domination number |

split graph |

split graphs |

square |

s-regular Cayley graph |

stability |

stability number |

stable graph |

stable graphs |

stable matching |

stable perfect matching |

stable set |

stable sets |

star |

star-cycle factor |

star-like trees |

stars |

star coloring |

star factor |

star partitions |

state splitting |

Steiner convexity |

Steiner distance |

Steiner number |

stratified graph |

stretch number |

strip |

strongly chordal graphs |

strongly independent set |

strongly multiplicative graphs. |

strongly perfect graphs |

strongly polynomial-time |

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 |

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 |

superior edge geodetic set |

supermagic graphs |

super-magic labeling |

supermultiplicative |

super edge-antimagic labeling |

super edge-magic labeling |

surface |

surplus |

switching classes |

symmetric dominating set |

symmetric graphs |

symmetric Hamilton cycle |

T |

tame mold |

tandem-win |

T-distance |

tensor products |

T-factorization |

T-geodesic |

theta graph |

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 |

thresholds |

threshold graph |

threshold graphs |

tight hypergraphs |

tight tournament |

toroidal chessboards |

toroidal grid |

torus |

totally multicoloured |

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 |

toughness |

tournament |

tournaments |

tour girth |

T-path |

$T_p$-tree |

traceability |

traceable |

traceable graphs |

trail |

transfer matrix method |

transitive digraph |

transitive digraph, |

transitive graphs |

transitive tournament |

transit function |

transversal set |

traveling salesman problem |

travelling salesman problem |

travers-ability |

tree |

trees |

tree graph |

tree packing |

triangle-free graph |

triangle-free graphs |

triangle avoidance game |

triangular lattice |

triangulated surface |

triangulation |

triple systems |

trivially perfect graph |

Tutte polynomial |

twin subsets |

two-factor |

two-point concentration |

two paths problem |

type of a face |

U |

unavoidable set |

underlying graph |

undirected graph |

unicyclic graph |

unicyclic graphs |

uniform hypergraph |

uniquely 3-list colorable graph |

uniquely embeddable graphs |

uniquely H-colourable |

uniquely partitionable graphs |

uniquely partitionable planar graphs |

uniquely partitionable system |

unique colorability |

unique factorization |

unique k-factor |

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 $\gamma$-labeling |

variety |

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 |

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 |

Vizing`s conjecture |

Vizing's conjecture |

W |

walk double cover |

weak-extreme vertex |

weakly-modular graph |

weakly connected domination number |

weakly connected domination subdivision number |

weakly convex domination number |

weakly geodetic graph |

weakly saturated graphs |

weakly universal graph |

weak-retract |

weak Cartesian product |

weak dual |

weak parity vertex colouring |

weak Roman domination number |

weak saturation |

weight |

weighted degree |

weighted degree |

weighted dgph |

weighted graph |

weight of an edge |

weight of a graph |

weight of a path |

weight of path |

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 |

$x$-detour hull number |

$x$-detour number |

Z |

Zagreb indices |

Zykov sums |