| . |
|---|
| 0 |
| $\{${\it E, net}$\}$-free graphs |
| ($k$-tuple total domination) number |
| $1$-dependence |
| $1$-embeddable graph |
| $1$-embedding |
| $1$-factor |
| 10-regular graph |
| 1-2-3 conjecture |
| 1-2-3 Conjecture |
| 1,2,3-Conjecture |
| 1,2-Conjecture |
| 12-representable graph |
| 12-representable graphs |
| 1-factor |
| 1-hamiltonian |
| 1-planar graph |
| 1-planar graphs |
| 1-tough graph |
| $2$-connected graph |
| $2$-con\-nected minor |
| $2$-distance operator |
| $2$-domination |
| $2$-domination number |
| $2$-factor |
| $2$-factor Hamiltonian |
| $2$-factorizations |
| $2$-factors |
| $2$-hypertree |
| $2$-independence number |
| $2$-rainbow dominating function |
| $2$-rainbow domination number |
| (2,2)-domination number |
| 2-dimensional manifolds |
| 2-dipath $L(2,1)$-labeling |
| 2-distance coloring |
| 2-domination |
| 2-domination number |
| 2-edge-colored graph |
| 2-edge-connected |
| 2-edge-connected graph |
| 2-factor |
| 2-factor hamiltonian |
| 2-hypertree |
| 2-independence number |
| $\{2K_2 |
| $2P_7$ |
| 2-packing |
| 2-planar graphs |
| 2-rainbow domination |
| 2-regular graph |
| 2-step dominating set |
| 2-step graph |
| 2-sum |
| 3 dimensional rectangular blocks |
| $3$-chromatic triangle |
| $3$-connected planar graphs |
| $3$-kernel |
| $3$-percolation number |
| 3/5-conjecture |
| 3-alternating cycle |
| 3-coloring |
| 3-connected |
| 3-connected graph |
| 3-edge-connected graph |
| 3-kernel |
| 3-path |
| 3-polytope |
| 3-quasi-transitive digraph |
| 3-quasitransitive digraph |
| 3-SAT |
| 3-simplicial vertex |
| 3-sum |
| 3-sun |
| 3-transitive digraph |
| 4-connected graph |
| 4-connected planar graph |
| 4-critical graph |
| 4-regular |
| 4-regular graph |
| 4-transitive digraph |
| 5-cycles |
| 5-regular graph |
| 5-star |
| 7-connected maximal $1$-plane graph |
| [a,b]-factor |
| $(a,d)$-antimagic labeling |
| $(a,d)$-face antimagic labeling |
| (a,d)-antimagic labeling |
| (a,d)-vertex-antimagic total labeling |
| $\alpha $-valuation |
| $\alpha$-domination |
| $\alpha$-labeling |
| $\alpha$-like labeling |
| $\alpha$-perfect digraph |
| $\alpha$-permutation graph |
| $\alpha$-Perron vector |
| $\alpha$-spectral radius |
| $\alpha_{2}$-stable set |
| $\chi$-binding function |
| (co-) reciprocal polynomials |
| (countable) graph |
| $\Delta$-matroids |
| (edge, vertex)-geodetic set |
| (edge-)connectivity |
| $\ell$-covering $k$-hypergraph |
| (finitely-)induced-hereditary property |
| $\gamma$-bad/good vertex |
| $\gamma$-cycle |
| $\gamma$-labeling |
| $\gamma$-labelings |
| $(I,F)$-partition |
| p-Wiener free interval |
| $(k,l)$-edge-maximal hypergraphs |
| $(k,l)$-kernel |
| (k,l)-kernel |
| (k,ℓ)-rainbow connected |
| (k,ℓ)-rainbow connection number |
| $\lambda'$-optimal |
| $(\lambda,\mu)$-graph |
| $(\lambda,\mu)$-tree |
| $(L,d)^{*}$-coloring |
| (long, optimal, Hamilton) cycle |
| $\mathcal P$ connection |
| $\mathcal P$ vertex-connection |
| $\mathcal{H}$-factor |
| $\mathcal{H}$-factor deleted graph |
| $(m,d)^{*}$-choosable |
| (net) Laplacian matrix |
| $(p,1)$-total labelling |
| $(P_{\geq k},n)$-factor critical avoidable graph |
| (P,Q)-total (a,b)-list colorings |
| (P,Q)-total coloring |
| $\rho$-labeling |
| $(s, t)$-supereulerian |
| $\sigma_3$ condition |
| (signless Laplacian) spectral radius |
| $\theta_1$-perfect graphs |
| $(t,k)$-complementing permutation |
| (weakly) finite character |
| α-graph |
| α-labeling |
| γ-cycle |
| Γ-extension |
| A |
| $A$-cordial |
| $A_\alpha$-matrix |
| $A_{\alpha}$-spectrum |
| abelian group |
| absorbing set of vertices |
| accurate domination number |
| achromatic index |
| achromatic number |
| achromatic numbers |
| acyclic chromatic index |
| acyclic coloring |
| acyclic colouring |
| acyclic digraph |
| acyclic disconnection |
| acyclic matrices |
| acyclic set |
| additive |
| additive and hereditary graph classes |
| additive coloring |
| additive degree-Kirchhoff index |
| additive hereditary class |
| additive hereditary graph property |
| additive hereditary properties |
| additive induced-hereditary property of graphs |
| additivity |
| adjacency dimension |
| adjacency matrix |
| adjacency spectrum |
| adjacency tensor |
| adjacent vertex distinguishing edge coloring |
| adjacent vertex distinguishing total coloring |
| adjacent vertex-distinguishing |
| adjoint polynomial |
| adomatic number |
| algebraic connectivity |
| algebraic frustration |
| algorithm |
| algorithms |
| algorithms on graphs |
| all fractional (a,b,k)-critical graph |
| all sizes |
| alliance |
| alliances |
| alliances in graphs |
| almost complete 3-uniform hypergraph |
| almost cospectral graphs |
| almost Platonic graph |
| almost self-complementary hypergraph |
| almost self-complementary hypergraph |
| almost well-dominated graphs |
| alternating cycle |
| alternating kernel |
| alternating path |
| alternating set |
| alternating-pancyclic graph |
| amalgam |
| amalgamation |
| ample tournament |
| annihilation |
| annihilation number |
| antidirected spanning trail |
| anti-Gallai graphs |
| antimagic labeling |
| antipodal edge-coloring |
| antipodal graph |
| antipodal number |
| antiprism |
| anti-Ramsey |
| anti-Ramsey number |
| approximation algorithm |
| APX-complete |
| APX-hard |
| arank number |
| arbitrarily partitionable graph |
| arbitrarily partitionable graphs |
| arbitrarily vertex decomposable |
| arbitrarily vertex decomposable graphs |
| arbitrary path decomposition |
| arboreal hypergraph |
| arboricity colorings |
| arc reversal |
| arc-colouring |
| arc-disjoint |
| arc-disjoint Hamiltonian paths |
| arc-transitive |
| arithmetic labeling of a graph |
| arithmetical maximal set |
| ascending subgraph decomposition |
| association scheme |
| asteroidal quadruples |
| asymptotic enumeration |
| asymptotic size |
| asymptotics |
| atom |
| A-trails |
| AutoGraphiX |
| autographs |
| automated conjecture making |
| automorphism group |
| automorphism groups |
| automorphisms |
| automorphisms of graphs |
| average degree |
| avoiding edge coloring |
| axiomatic characterization |
| axiomatizable property |
| B |
| backbone coloring |
| bad cycle |
| bad function |
| balance |
| balanceable graphs |
| balanced edge-coloring |
| balanced graph |
| balanced hypercube |
| balanced hypercubes |
| balanced sigraph |
| balloon graph |
| Banhatti indices |
| 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 |
| bdomatic number |
| b-domatic partition |
| bend |
| benzenoid graph |
| beta invariant |
| beta-number |
| betweenness |
| bfs |
| BFS-cons-tructible graph |
| bicyclic hypergraph |
| bidirected graph |
| bigraphic pair |
| bihole |
| bihypergraphs |
| binary matroid |
| binding number |
| binomial coefficients |
| binomial tree |
| bipancyclic |
| bipancyclicity |
| bipartite |
| bipartite (canonical) double covering |
| bipartite digraph |
| bipartite graph |
| bipartite graphs |
| bipartite labeling |
| bipartite permutation graphs |
| bipartite Ramsey number |
| bipartite Ramsey numbers |
| bipartite tournament |
| bipartite-hole-number |
| bipartite-join |
| bipartite-split graph |
| bipartite-splittance |
| bipartition |
| bi-placing |
| biregular |
| biregular cages |
| bi-regular hypergraph |
| block |
| block closure |
| block design |
| block designs |
| block graph |
| block graphs |
| block-chain traceable graph |
| block-cutpoint tree |
| blow-ups of graphs |
| bluff graphs |
| bondage number |
| book |
| bootstrap percolation |
| bound |
| boundary |
| boundary independence |
| boundary walk |
| bounded degree graphs |
| bounds |
| box complexes |
| branch vertex |
| branch vertices |
| branch-and-bound |
| branch-weight |
| branch-weight sequence |
| branch-weight unique |
| branchwidth |
| bridge |
| bridged graph |
| broadcast chromatic number |
| broadcast domination |
| broadcast domination number |
| broadcast independence |
| broken circuit |
| broken circuits |
| broken cycles |
| Broken-cycle Theorem |
| broom |
| Burkard-Hammer condition |
| Burkard-Hammer graph |
| Burnside ring |
| bypass vertex |
| C |
| C_4\}$-free graphs |
| C4-free |
| cactus |
| cactus graph |
| cactus graphs |
| cage |
| cage,$k$-regular graph |
| cages |
| cancellation |
| capture time |
| cardinal product |
| Cartesian and weak Cartesian product |
| Cartesian fixer |
| Cartesian graph product |
| Cartesian multiplier |
| cartesian product |
| 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 graph |
| Cayley graphs |
| Cayley sum graph |
| Cayley sum integral group |
| center |
| central graph |
| central subtree |
| centroid |
| centrosymmetric matrix |
| chain graphs |
| chain in hypergraph |
| channel assignment |
| channel assignment problem |
| characteristic polynomial |
| characteristic polynomial |
| characterization |
| chemistry |
| choice function |
| choice index |
| choice number |
| choice-perfect graph |
| choosability |
| chord |
| chordal bipartite graphs |
| chordal graph |
| chordal graphs |
| chordless graph |
| chords |
| chromatic characterization |
| chromatic edge stability index |
| chromatic equivalence class |
| chromatic index |
| chromatic number |
| chromatic parameters |
| chromatic polynomial |
| chromatic polynomials |
| chromatic Ramsey numbers |
| chromatic spectrum |
| chromatic sum |
| chromatic uniqueness |
| chromatic uniqueness of graphs |
| chromatically equivalent graphs |
| chromatically unique graphs |
| chromatically unique hypergraphs |
| chromatic-choosable graphs |
| Chv\'atal graph |
| Chv\'atal-Erd\H{o}s theorem |
| Chvátal-Erdos condition |
| Chvátal-Erdös condition |
| Chvátal's Condition |
| circle graph |
| circle graphs |
| circuits |
| circulant |
| circulant graph |
| circulant graphs |
| Circulant tournament |
| circulants |
| circular arc graphs |
| circular chromatic number |
| circular coloring |
| circular colouring |
| circular dichromatic number |
| circular dimension |
| circular (P,Q)-total chromatic number |
| circular-arc graph |
| circular-arc graphs |
| circumference |
| clan |
| Clar number |
| Clar set |
| Clark and Suen bound |
| class two graphs |
| classification of cubic semisymmetric graphs |
| claw |
| claw-free |
| claw-free graph |
| claw-free graphs |
| clique |
| clique covering |
| clique domination |
| clique graph |
| clique irreducible graphs |
| clique minor |
| clique number |
| clique partition |
| clique separator |
| clique spectrum |
| clique tree |
| clique trees |
| clique vertex irreducible graphs |
| clique-acyclic clique |
| cliques |
| closed k-stop distance |
| closed modular $k$-coloring |
| closed modular chromatic number |
| closed neighborhood |
| closed neighborhoods |
| closed surfaces |
| closure |
| closure theory |
| cluster |
| coalition |
| coalition graphs |
| coalition number |
| coalition partition |
| cobondage number |
| cocktail-party graph |
| coclique |
| co-edge-regular graph |
| cographic |
| cographic matroid |
| co-graphs |
| cointerval graph |
| co-irredundance |
| collapsible |
| collapsible graphs |
| collapsible graph |
| color eigenvalues |
| color energy |
| color-bounded hypergraph |
| color-class digraph |
| colored regularity graphs |
| coloring |
| coloring |
| coloring graphs by sets |
| coloring of hypergraphs |
| coloring squares of planar graphs |
| colorings |
| colorings of graphs and hypergraphs |
| color-perfect digraph |
| colour set |
| coloured label |
| colouring algorithms |
| colouring game |
| colouring graph |
| colouring number |
| colouring of edges in a cycle |
| colourings |
| comain graphs |
| combinatorial analysis |
| combinatorial game |
| combinatorial games |
| Combinatorial Nullstellensatz |
| combinatorial optimization |
| combinatorial search |
| combinatorics |
| common monochromatic subgraph |
| communicability distance |
| compact graph |
| compactness theorems |
| comparability graph |
| compatible Euler tour |
| competition graph |
| competition graphs |
| competition hypergraph |
| competition number |
| complement |
| complement of a graph |
| complementary eigenvalues |
| complementary graph |
| completability |
| complete balanced multipartite graph |
| complete binary tree |
| complete bipartite graph |
| complete bipartite graphs |
| complete colorings |
| 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 |
| complete vertex colouring |
| completely independent critical cliques |
| completely independent spanning tree |
| completeness |
| complex network |
| complex networks |
| complexity |
| complexity classes |
| complexity of algorithms |
| component |
| composite graphs |
| composition graph |
| computation |
| computational analysis |
| computational complexity |
| computer search |
| conditional connectivity |
| conflict-free connection |
| conflict-free vertex-connection |
| conflict-free vertex-connection number |
| congruences and quotients of graphs |
| conjectures |
| conjunction of graphs |
| connected dominating set |
| connected domination |
| Connected domination |
| connected domination number |
| connected forcing connected vertex detour number |
| connected global offensive k-alliance |
| connected graph |
| connected matching |
| connected resolving partition |
| connected vertex detour number |
| connectedness |
| connectednesses and disconnectednesses of graphs |
| connective eccentricity index |
| connectivity |
| coNP-complete |
| consecutive coloring |
| consecutive (interval) colouring |
| consistent sigraph |
| constant sum partition |
| constant-weight |
| constructible graph |
| contractible edge |
| contractible Hamiltonian cycles |
| contractible subgraph |
| contraction |
| conversion sets |
| convex 3-polytope |
| convex combination of matrices |
| convex combination of MTDFs |
| convex domination |
| convex geometries |
| convex geometry |
| convex hull |
| convex sets |
| convexity |
| cop |
| copies of graphs |
| cops and robbers |
| cop-win graphs |
| cordial graph |
| cordial labeling |
| core |
| core graph |
| core graphs |
| core index |
| cores |
| co-Roman dominating function |
| co-Roman domination number |
| corona |
| corona. |
| corona graph |
| corona over graphs |
| corona product |
| corona product graphs |
| corona product of graphs |
| corona products |
| cospectral |
| cospectral graphs |
| cost chromatic number |
| cost coloring |
| cost colouring |
| cost of 2-distinguishing |
| co-strongly perfect graphs |
| countable graphs |
| counting |
| coupon coloring |
| covering |
| covering codes |
| covering design |
| covering number |
| covering numbers |
| covering of graphs |
| covering projection |
| Coxeter move |
| critical |
| critical clique |
| critical graph |
| critical graphs |
| critical independent set |
| critical kernel-imperfect |
| critical random intersection graph |
| critical vertex |
| criticality |
| critical-kernel-imperfect digraph |
| cross free |
| crossed cube |
| crossing nr |
| crossing number |
| crown |
| cube graph |
| cubic |
| cubic bridge graph |
| cubic graph |
| cubic graphs |
| cubic multigraph |
| cubic traceable graph |
| cut |
| cut vertex |
| cut-edge |
| cuts |
| cut-vertex |
| cut-vertices |
| cutwidth |
| cycle |
| cycle basis |
| cycle coverings |
| cycle decomposition |
| cycle double cover |
| cycle extendability |
| cycle extendable |
| cycle extendable graph |
| cycle factor |
| cycle packing |
| cycle rank |
| cycle space |
| cycle-pancyclism |
| cycles |
| cycles of different lengths |
| cyclic and linear radio k-labeling |
| cyclic chromatic number |
| cyclic coloring |
| cyclic colouring |
| cyclic permutation |
| cyclically $3$-partite digraphs |
| cyclically $k$-partite |
| cyclically $t$-complementary hypergraph, |
| cyclically 1-generated |
| cyclomatic number |
| cylinder |
| D |
| $D$-vertex magic graph |
| daisy graphs |
| dandelion |
| d-cube |
| decomposability |
| decomposable |
| decomposable graph |
| decomposable property of graphs |
| decomposition |
| decomposition of a complete bipartite graph |
| decomposition tree |
| decycling number |
| defective coloring |
| defensive alliance |
| defensive (global offensive) $k$-alliance number |
| deficiency |
| defining set |
| degeneracy |
| degenerate set |
| degree |
| degree and diameter of a graph |
| degree condition |
| degree of a vertex |
| degree sequence |
| degree sequence index strategy |
| degree sequence pair |
| degree sequences |
| degree sets |
| degree sum |
| degree sum condition |
| degree sum conditions; vertex disjoint 5-cycles |
| degree-diameter problem |
| degree/diameter problem |
| degree-magic graphs |
| degrees of vertices |
| density |
| dePoissonization |
| depth first search |
| Desarguesian finite projective geometry |
| detection distinguishing open-locating-dominating set |
| detection number |
| detection system |
| determinant of graph |
| determinants |
| determining number |
| detour |
| detour hull number |
| detour number |
| detour transversal |
| diagonal flip |
| diagonal ladder |
| diameter |
| diameter of a graph |
| diametrical graph |
| dichromatic nr |
| dichromatic number |
| difference digraph |
| difference graph |
| difference graphs |
| differentials in graphs |
| differentiating-total dominating set |
| differentiating-total domination |
| digital convexity |
| digraph |
| digraph decompositions |
| digraph factorial |
| digraph homomorpism |
| digraph with minimum outdegree 3 |
| digraphs |
| dilation |
| dimensional properties |
| dimer problem |
| dipole |
| Dirac's family |
| direct product |
| direct product of graphs |
| directed cograph |
| directed cycle |
| directed cycle factorizations |
| directed graph |
| directed graphs |
| directed path |
| directed path graph |
| directed tree |
| discharging |
| discharging method |
| disconnected graph |
| discrete torus |
| disjoint copies |
| disjoint cycles |
| disjoint pairs |
| disjoint paths |
| disjoint sets |
| disjoint union of \linebreak graphs |
| disjunctive total domination |
| dismantlable graphs |
| dissociation number |
| dissociation ratio |
| distance |
| distance k-resolving domination |
| distance $k$-dominating function |
| distance $k$-domination |
| distance 2-dominating set |
| 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-domination |
| distance k-domination number |
| distance local connectivity |
| distance magic graph |
| distance magic index |
| distance magic labeling |
| distance matrix |
| distance set |
| distance signless Laplacian matrix |
| distance spectral radius |
| distancebalanced graph |
| distance-colored digraphs |
| distance-hereditary graph |
| distance-transitive graphs |
| distance-two coloring |
| distant chromatic number |
| distinguishable graph |
| distinguishing |
| distinguishing chromatic number |
| distinguishing coloring |
| distinguishing index |
| distinguishing number |
| distinguishing sets |
| distinguishing vertices |
| distributive lattice |
| divisibility |
| divisor graph |
| D-join |
| domatic |
| domatic number |
| domatic partition |
| dominated chromatic number |
| dominated claw toes |
| dominated coloring |
| dominated pair degree sum condition |
| dominating broadcast labeling |
| dominating closed trail |
| dominating cycle |
| dominating function |
| dominating induced matching |
| dominating set |
| Dominating set |
| dominating sets |
| dominating subgraph |
| domination |
| domination chain |
| domination critical |
| domination digraph |
| domination game |
| domination game critical graphs |
| domination gap |
| domination graph |
| domination in graphs |
| domination multisubdivision number |
| domination nr |
| domination number |
| domination parameters |
| domination polynomial |
| domination subdivision number |
| dominator chromatic number |
| dominator coloring |
| dot product |
| double vertex graph |
| double dominating sequences |
| double domination |
| double domination number |
| double generalized Petersen graph |
| double geodetic number |
| double geodetic set |
| double graphs |
| double Italian domination |
| double Roman domatic number |
| double Roman domination |
| double star |
| double total domination |
| double-critical conjecture |
| double-stars |
| doubly chordal graph |
| doubly light vertex |
| doubly partial order |
| d-partite complete hypergraph |
| DP-colorings |
| drawing |
| drawings |
| $d^{\text{th}}$ power of graph |
| dual alliance |
| dual closure |
| dual graph |
| dual-chordal graph |
| duality |
| dually compact closed class |
| duplicate and co-duplicate vertices |
| duplication |
| dynamic programming |
| E |
| eccentric distance sum |
| eccentricity |
| eccentricity (of vertex) |
| edge $C_4$ graph |
| edge $H$-irregularity strength,
prism |
| edge choosable |
| edge clique cover |
| edge coloring |
| edge coloring, anti-Ramsey number, dominating set |
| edge coloring of signed graphs |
| edge coloured digraph |
| edge colouring |
| edge congestion |
| edge connectivity |
| edge contraction |
| edge corona |
| edge covering number |
| edge decomposition |
| edge decompositions |
| edge deleted graphs |
| edge deletion |
| edge detour basis |
| edge detour number |
| edge detour set |
| edge dimension |
| edge disjoint |
| edge dominating set |
| edge domination |
| edge geodetic number |
| edge independence number |
| edge intersection hypergraph |
| edge label growth-rate |
| edge labeling |
| edge perturbations |
| edge ranking |
| edge removal |
| edge rotation |
| edge stability number |
| edge subdivision |
| edge weight |
| edge-chromatic critical graphs |
| edge-colored graph |
| edge-coloring |
| edge-coloured digraph |
| edge-colouring |
| edge-connectivity |
| edge-critical |
| edge-cuts |
| edge-disjoint tree |
| edgedisjoint trees |
| edgehyper-Hamiltonian laceability |
| edge-intersection graph of paths in a tree |
| edge-intersection of paths on a grid |
| edge-magic labelling |
| edge-magic total labeling |
| edge-magic total labelling |
| edge-maximal graph |
| edge-maximal hypertree |
| edgemaximal hypertree |
| edge-minimal hypertree |
| edge-multiplicity-paths-replacement graph |
| edge-partition |
| edge-separator tree |
| edge-sum distinguishing game |
| edge-to-edge median |
| edge-to-vertex median |
| edge-transitive graph |
| edgetransitive graphs |
| edge-weighting |
| edge-Wiener index |
| edit distance |
| efficient $(j,k)$-dominating function |
| efficient dominating set |
| efficient domination |
| efficient domination set |
| eigenspaces |
| eigenvalue |
| eigenvalues |
| eigenvalues of a graph |
| electric power system |
| element splitting operation |
| elimination ordering |
| elimination properties |
| embedded graph |
| embedded multigraph |
| embedding |
| embeddings |
| end |
| end super dominating set |
| end super domination number |
| end-blocks |
| ends |
| energy |
| energy of a graph |
| enhanced line graph |
| entire weighting |
| enumeration |
| enumeration of trees |
| EPG |
| EPTAS |
| equienergetic graphs |
| equimatchable |
| equitable choosability |
| equitable chromatic number |
| equitable cluster partition |
| equitable coloring |
| equitable coloring conjecture |
| equitable graph coloring |
| equitable list coloring |
| equitable total coloring |
| Erd\H os-Ko-Rado theorem |
| Erd\H{o}s-Gallai type problem |
| Erd\H{o}s-Gallai-type problem |
| Erd\H{o}s-Ko-Rado theorem |
| Erdos jumping constant conjecture |
| Erdos problem |
| Erdos-Faber-Lovász conjecture |
| Erdos-Gallai condition |
| Erdos-Gallai type problem |
| Erdos-Gya´rf´as conjecture |
| error-correcting code |
| error-correcting codes |
| error-detection |
| essentially 4-connected planar graph |
| estrada index |
| eternal dominating set |
| eternal domination |
| eternal m-secure set |
| eternal msecurity bondage number |
| eternal m-security number |
| Euclidean plane |
| Euler family |
| Euler tour |
| eulerian |
| Eulerian irregularity |
| Eulerian walks |
| Euler's formula |
| evasiveness |
| even factor |
| even planar triangulation |
| exact double domination |
| excellent graph |
| excellent trees |
| expandable tree |
| expansion |
| expansion procedures |
| expansion theorem |
| exponential dominating set |
| exponential domination |
| extendable |
| extended line graph |
| extended Mycielski graph |
| extremal |
| extremal graph |
| extremal graph theory |
| extremal graphs |
| extremal hypergraph |
| extremal problem |
| extremal problems |
| extreme geodesic graph |
| extreme vertex |
| F |
| face |
| face colouring |
| face irregular labeling |
| face irregularity strength |
| face size |
| face-centered cubic grid |
| facial coloring |
| facial incidence coloring |
| facial path |
| facial-parity edge-coloring |
| facial-parity vertex-coloring |
| factor |
| factor of graph |
| factor-critical graph |
| factor-criticality |
| factorization |
| factors of the de Bruijn graph |
| fair domination |
| fair total domination |
| fall coloring of graphs |
| family of subsets |
| fan |
| fan graph |
| Fan-Raspaud conjecture |
| Fan-Raspaud Conjecture |
| Fan-type heavy subgraph |
| fault tolerance |
| fault tolerant detectors |
| fault-tolerance |
| fault-tolerant |
| F-domination |
| feasible set |
| feedback function |
| felicitous labellings |
| FETI |
| Fibonacci |
| Fibonacci numbers |
| filled odd antihole |
| filled odd hole |
| finite affine geometry |
| finite Euclidean graphs |
| finite metric space |
| finite projective geometry |
| finitely determined property |
| flexible $q$-labeling |
| flow graph |
| flower conjecture |
| flower snark |
| folded hypercube |
| Folkman number |
| Folkman numbers |
| forbidden |
| forbidden graph |
| forbidden hypergraphs |
| forbidden induced subdigraph |
| forbidden induced subgraph |
| forbidden induced subgraphs |
| forbidden minor |
| forbidden subgraph |
| forbidden subgraphs |
| forbidden-subgraph colorings |
| forcing connected vertex detour number |
| forcing geodetic number |
| forcing number |
| forcing set |
| forcing Steiner number |
| forest |
| forest and triangle-free graph |
| forest graph operator |
| forests |
| formal concept analysis |
| Fowler construction |
| fractional [a,b]-factor |
| fractional (a,b,k)-critical graph |
| fractional chromatic number |
| fractional chromatic numbers |
| fractional coloring |
| fractional distance $k$-domination |
| fractional domination |
| fractional domination number |
| fractional global domination number |
| fractional ID-[a,b]-factor-critical graph |
| fractional matchings |
| fractional (P,Q)-total chromatic number |
| fractional revival |
| fragment |
| frequency assignment |
| friends-and-strangers graph |
| Friendship Theorem |
| Frucht's theorem |
| Fulkerson's conjecture |
| full |
| full domination |
| full star domination |
| fullerene |
| fullerene graph |
| fully cycle extendability |
| functigraphs |
| function reducible graphs |
| function separable graphs |
| F\"{u}redi's structure theorem |
| G |
| gain graph |
| Gale-Shapley model |
| Gallai equality |
| Gallai graphs |
| Gallai multigraph |
| Gallai-Ramsey number |
| Gallai's Theorem |
| game |
| game chromatic number |
| game colouring number |
| game domination number |
| game-perfect digraph |
| game-perfect graph |
| games on graphs |
| gamma graphs |
| gamma sets |
| gap |
| gap in the chromatic spectrum |
| gated subgraph |
| gatedness |
| g-cycle |
| gear graph |
| gem graph |
| genealogical tree |
| general position number |
| general edge coloring |
| general model of a random digraph |
| general position number |
| general position set |
| generalised chromatic number |
| generalised inverse |
| generalised irredundance |
| generalised Mycielski graphs |
| generalization |
| generalized $k$-con\-nectivity |
| generalized $k$-connectivity |
| generalized $k$-edge-connectivity |
| generalized chromatic number |
| generalized claw-free graphs |
| generalized colouring |
| generalized colouring game |
| generalized colourings |
| generalized complete bipartite graphs (GCB) |
| generalized connectivity |
| generalized degree |
| generalized dihedral group |
| generalized domination |
| generalized edge-chromatic number |
| generalized (edge-)connectivity |
| generalized edge-connectivity |
| generalized hierarchical product |
| generalized hypercube |
| generalized line graph |
| generalized median graphs |
| generalized Mycielskians |
| generalized Paley graphs |
| generalized Petersen graph |
| generalized Petersen graphs |
| generalized prisms |
| generalized Ramsey theory |
| generalized sum list coloring |
| generalized total colorings |
| generalized tournament |
| generalized Tur\'{a}n number |
| generalized Tur\'an problem |
| generalized-theta-graph |
| generating function |
| generating functions |
| generating sets |
| generation |
| genus |
| geodesic |
| geodesic convexity |
| geodesic graph |
| geodesics |
| geodetic dominating set |
| geodetic graph |
| geodetic number |
| geodetic set |
| geometric graphs |
| geometric labeling of a graph |
| geometric probability |
| geometry |
| girth |
| global alliance |
| global dominated coloring |
| global dominating function |
| global domination |
| global dominator coloring |
| global double Roman domination |
| global offensive k-alliance |
| global offensive k-alliance number |
| global triple Roman domination |
| graceful graph |
| graceful labeling |
| graceful labellings |
| graceful triangle |
| graph |
| graph algorithms |
| Graph algorithms |
| graph automorphisms |
| graph bundles |
| graph center |
| graph characterization |
| graph coloring |
| graph colorings |
| graph colouring |
| graph composition |
| graph coverings |
| graph decomposition |
| graph decomposition and factorization |
| graph decompositions |
| graph degeneracy |
| graph density |
| graph determined by its spectrum |
| graph direct product |
| graph distinguishing |
| graph domination |
| graph duality |
| graph dynamics |
| graph eigenvalues |
| graph embeddings |
| graph exponentiation |
| graph factorization |
| graph factors |
| graph grabbing game |
| graph grabbing games |
| graph homomorphisms |
| graph invariants |
| graph isomorphism |
| graph join |
| graph labeling |
| graph labelling |
| graph linkages |
| graph metric |
| graph operations |
| graph operator |
| graph operators |
| graph orientation |
| graph pebbling |
| graph polynomials |
| graph power |
| graph product |
| graph product cancellation |
| graph products |
| graph properties |
| graph property |
| graph property of finite character |
| graph property with assignment |
| graph representation |
| graph retraction |
| graph rubbling |
| graph saturation |
| graph searching |
| graph size |
| graph spectral radius |
| graph spectrum |
| graph tensor product |
| graph theory |
| graph transformation |
| graph with colouring number at most k+1 |
| graph with connectivity 2 |
| graph-decompositions |
| graphic |
| graphic matroid |
| graphs |
| graphs direct product |
| greedy algorithm |
| gregarious factor |
| grid |
| grid graph |
| grids |
| Grinberg's theorem |
| Gr\"otzsch graph |
| Grotzsch-Sachs graph |
| Grundy coloring |
| grundy function |
| Grundy function |
| Grundy total domination number |
| guarding |
| Gutman index |
| H |
| $H$-coloring |
| $H$-covering |
| $H$-irregular edge labeling |
| $H$-irregular labeling |
| $H$-kernel |
| Hadwiger conjecture |
| Hadwiger's Conjecture |
| Hajós' construction |
| half-convexity |
| halin graph |
| Halin graph |
| Halin graphs |
| Hall's Matching Theorem |
| hamilton cycle |
| Hamilton cycle |
| Hamilton cycle decomposition |
| Hamilton Cycle Problem |
| hamilton cycles |
| Hamilton-connected |
| Hamilton-connected graph |
| hamiltonian |
| Hamiltonian |
| hamiltonian circuit |
| Hamiltonian coloring exponents |
| hamiltonian cycle |
| Hamiltonian cycle |
| hamiltonian cycles |
| hamiltonian cycles and paths |
| hamiltonian decomposition |
| Hamiltonian extendable |
| hamiltonian graph |
| Hamiltonian graph |
| hamiltonian graphs |
| Hamiltonian number |
| hamiltonian path |
| Hamiltonian path |
| Hamiltonian spectrum |
| Hamiltonian walk |
| Hamiltonian-colored digraphs |
| Hamiltonian-connected |
| hamiltonicity |
| Hamiltonicity |
| hamiltonicity and circumference |
| Hamming graph |
| Hamming graphs |
| Hanoi graph |
| Hanoi graphs |
| Harary index |
| harmonic graph |
| harmonic index |
| harmonious chromatic number |
| harmonious coloring |
| harmonious labeling |
| harmonious labellings |
| H-covering |
| hearing independence |
| heavy cycles |
| heavy subgraph |
| heavy subgraphs |
| Heawood graph |
| Hedetniemi's conjecture |
| height |
| Helly graph |
| Helly number |
| Helly property |
| Helm graphs |
| hereditary |
| hereditary class |
| 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 |
| heuristic |
| hexagonal graph |
| hexagonal grid |
| hexagonal lattice of the plane |
| hexagonal tiling |
| H-force number |
| H-free graph |
| highly irregular property |
| Hilton-Spencer theorem |
| H-irregular labeling |
| H-irregularity strength |
| history |
| hitting times |
| Hoehnke radicals of graphs |
| homogeneous set |
| homomorphism |
| homomorphism duality |
| homomorphism (of graphs) |
| hom-property |
| hom-property of graphs |
| hooked Skolem sequence |
| hop domination |
| Hosoya index |
| host graph |
| hull |
| hull number |
| hypercube |
| hypercubes |
| hypercycle |
| hypergraph |
| hypergraph colourings |
| hypergraph convexity |
| hypergraph decomposition |
| hypergraph Lagrangian |
| hypergraph multiplicity |
| hypergraph properties |
| hypergraph rank |
| hypergraphs |
| hyper-Hamiltonian laceability |
| hypertree |
| hypertrees |
| hyper-Wiener index of a graph |
| hypotraceable |
| I |
| IC-planar graph |
| identifiable graph |
| identifying code |
| identifying-code |
| idomatic number |
| IE-total coloring |
| implicit c-heavy |
| implicit degree |
| implicit f-heavy |
| implicit o-heavy |
| improper coloring |
| incidence |
| incidence chromatic number |
| incidence coloring |
| incidence colouring |
| incident sum |
| incomplete latin rectangle |
| indecomposable |
| independence |
| independence nr |
| independence number |
| independence polynomial |
| independent |
| independent coalition number |
| independent 2-rainbow dominating function |
| independent coalition |
| independent coalition graph |
| independent domination |
| independent domination nr |
| independent domination number |
| independent number |
| independent Roman $\{2\}$-dominating function |
| independent Roman domination |
| independent set |
| independent set of vertices |
| independent sets |
| independent transversal dominating set |
| independent transversal total domination number |
| index |
| index of a graph |
| in-domination |
| induced hereditary classes |
| induced hereditary classes of graphs |
| induced matchings |
| induced paired-domination |
| Induced paths |
| induced Ramsey number |
| induced subgraphs |
| induced-hereditary |
| induced-hereditary properties |
| induced-hereditary property of graphs |
| induction |
| inequality |
| infinite digraph |
| infinite digraphs |
| infinite graph |
| infinite graphs |
| infinite grid |
| infinite planar graph |
| influence spread |
| injective |
| injective hull |
| in-neighbourhood |
| inner vertex number |
| integer distance graph |
| integer distance graph |
| integral graph |
| integral graphs |
| interconnection network |
| interference |
| internally $4$-connected |
| internally 4-connected |
| internally disjoint trees |
| intersecting family |
| intersection graph |
| intersection graphs |
| intersection hypergraph |
| intersection matrix |
| intersection number of a hypergraph |
| interval |
| interval containment bigraphs |
| interval $k$-graph |
| interval coloring |
| interval function |
| interval graph |
| interval graphs |
| interval incidence coloring |
| interval monotony |
| interval order |
| interval orders |
| interval representation |
| invariant |
| irreducible coloring |
| irreducible property |
| irredundance |
| irredundance number |
| irregular assignment |
| irregular digraph |
| irregular digraphs |
| irregular edge-coloring |
| irregularity of graphs |
| irregularity strength |
| irreversible $k$-threshold conversion |
| Ising model |
| isolatable vertex |
| isolated toughness |
| isolating set |
| isolation number |
| isometric dimension |
| isometric embeddings |
| isometric graph |
| isometric path cover problem |
| isometric path partition problem |
| isometric subgraph |
| isometric subgraphs |
| isomorphic factors |
| isomorphism |
| isomorphisms |
| Italian domination |
| iterated line graph |
| J |
| Johnson graph |
| join graphs |
| join in the lattice |
| join product |
| jump distance |
| jump distance graph |
| K |
| $k$-arc-connectivity |
| $k$-connectivity |
| $k$-covering |
| $k$-critical graph |
| $k$-distance Roman dominating function |
| $k$-distance Roman domination number |
| $k$-domination number |
| $k$-hamiltonian |
| $k$-independence number |
| $k$-independent |
| $k$-kaleidoscope |
| $k$-kernel |
| $k$-monophonic convexity |
| $k$-packing |
| $k$-partite |
| $k$-path-coverable |
| $k$-quasi-transitive digraph |
| $k$-rainbow index |
| $k$-rainbow total domination |
| $k$-transversal number |
| $k$-tree |
| $k$-trees |
| $k$-tuple dominating set |
| $k$-tuple domination number |
| $k$-tuple total domination |
| $K_{1,4}$-free |
| $K_4$-minor |
| kaleidoscope |
| kaleidoscopic coloring |
| kaleidoscopic pseudo-randomness |
| k-ary n-cubes |
| Katona's shadow intersection theorem |
| $k\cdot S_\ell$ |
| k-connected |
| k-connectivity |
| k-core |
| k-degenerate graph |
| k-domination |
| k-ended tree |
| kernel |
| kernel by $H$-paths |
| kernel by $H$-walks |
| kernel by alternating paths |
| kernel by monochromatic paths |
| kernel by monochromatic paths |
| kernel of a digraph |
| kernel of digraph |
| kernel perfect digraph |
| kernel-perfect |
| kernel-perfect digraph |
| kernels |
| k-factors |
| k-fun |
| k-independence |
| k-independence stable graphs |
| k-independent set |
| k-intersection edge colouring |
| Kirchhoff index |
| kite |
| kite graph |
| k-kernel |
| KKM covering |
| k-loosely tight |
| k-metric dimension |
| k-middle digraph |
| kneser graph |
| Kneser graph |
| Kneser graphs |
| K_n-free graphs |
| Kno¨del graph |
| Koester graph |
| Kotzig array |
| $K_p$-saturated graphs |
| k-partite graph |
| k-path vertex cover |
| k-planar graph |
| k-quasi-transitive digraph |
| k-rainbow domatic number |
| k-rainbow dominating function |
| k-rainbow domination |
| k-rainbow domination number |
| k-resolving set |
| k-restricted edge connectivity |
| kronecker product |
| Kronecker product |
| k-star |
| k-subdivision digraph |
| k-total digraph |
| k-traceable |
| k-transitive digraph |
| k-tree |
| k-trestle |
| k-tuple domination |
| k-tuple total domination |
| k-uniform hypergraph |
| Kurosh-Amitsur radicals of graphs |
| L |
| L(1,1)-labelling |
| $L(2,1)$-connection number |
| $L(2,1)$-connectivity |
| $L(2,1)$-labeling |
| L(2,1,1)-labeling |
| L(2,1)-coloring |
| L(2,1)-labeling |
| label~$1$ |
| labeled and reversible 2-structure |
| labeled packing |
| labeling |
| labeling game |
| labeling of hypergraph |
| labelling |
| Laborde-Payan-Xuong Conjecture |
| ladder graph |
| Lagrangian |
| Lagrangian density |
| Laplacian characteristic polynomial |
| Laplacian eigenvalues |
| Laplacian matrix |
| Laplacian spectrum |
| Laplacian-like energy |
| large degree vertices |
| largest component |
| largest eigenvalue |
| largest Laplacian eigenvalue |
| lattice |
| lattice of additive hereditary graph properties |
| lattice of properties of graphs |
| lattices |
| l-dominating set |
| leaf distance |
| leafage |
| leap |
| leap operation |
| leapfrog transformation |
| least central subtree |
| least eigenvalue of a graph |
| leaves |
| Lebesgue theorem |
| Lebesgue's Theorem |
| Lee's conjecture |
| left-pretransitive digraph |
| lexicographic |
| lexicographic graph product |
| lexicographic product |
| lexicographic product graphs |
| lexicographic product of graphs |
| lexicographic products |
| liar's domination |
| light edge |
| light graph |
| light subgraph |
| light subgraphs |
| Lights Out |
| light-switching game |
| limit cardinal number |
| limit point |
| limited packing |
| line digraph |
| line graph |
| line graphs |
| line grid graph |
| line stability |
| linear algebra |
| linear arboricity |
| linear coloring |
| linear edge geodetic set |
| linear forest |
| linear hypergraph |
| linear time algorithm |
| link of a vertex |
| link-irregular graph |
| list coloring |
| list colouring |
| list distinguishing |
| list edge chromatic number |
| list edge coloring |
| list improper coloring |
| list linear arboricity |
| list total coloring |
| list total colouring |
| list-coloring |
| lobster |
| local antimagic chromatic number |
| local antimagic labeling |
| local coloring |
| local matching conditions |
| local rings |
| local search algorithm |
| local tournament |
| locally $k$-nested-hamiltonian |
| locally connected |
| locally disconnected |
| locally Hamilton-connected |
| locally hamiltonian |
| locally Hamiltonian |
| locally reducible factor |
| locally reducible function |
| locally semicomplete |
| locally semicomplete digraph |
| locally traceable |
| locally transitive |
| locally-connected graph |
| locating domination number |
| locating Roman domination number |
| locating-dominating code |
| locating-dominating set |
| locating-domination number |
| locating-total dominating set |
| locating-total domination |
| locating-total domination number |
| location |
| Loebl-Koml\'{o}s-S\'{o}s type problems |
| long cycle |
| longest cycle |
| longest path |
| longest paths |
| looseness |
| Lov\'asz $\vartheta$ parameter |
| Lov\'asz's $(g,f)$-factor theorem |
| lower bounds |
| lower chromatic number |
| $L(p,q)$-labeling |
| ℓ-rainbow path |
| Lucas numbers |
| lucky labeling |
| M |
| $m$-bipartite Ramsey number |
| $m$-coloured digraph |
| magic and sequential graphs |
| magic constant |
| magic graphs |
| magic labeling |
| main eigenspace |
| majority |
| majority colouring |
| majority dominator chromatic number |
| majority dominator coloring |
| majorization |
| maker-breaker game |
| margin number |
| marking game |
| matching |
| matching extendability |
| matching energy |
| matching extension |
| matching number |
| matching polynomial |
| matching-connectivity |
| matching-covered graph |
| matchings |
| matrix graphic |
| matroid intersection |
| matroids |
| MAX |
| maximal $K_p$-free graphs |
| maximal common monochromatic subgraph |
| maximal common subgraph |
| maximal graph |
| maximal graphs |
| maximal hypergraphs |
| maximal independent set |
| maximal independent sets |
| maximal nonhamiltonian split graph |
| maximal outerplanar graphs |
| maximal partial clones |
| maximal subdigraph |
| maximally edge-connected graphs |
| maximum average degree |
| maximum cut |
| maximum degree |
| maximum independent set |
| maximum length cycle |
| maximum signed matching |
| Maxwell-Boltzman and Bose-Einstein allocation |
| m-coloured bipartite tournaments |
| m-coloured digraph |
| m-coloured quasi-transitive digraph |
| mean coloring |
| median |
| median graph |
| median graphs |
| Menger |
| meta-Fibonacci sequence |
| metric |
| metric basis |
| metric betweenness |
| metric dimension |
| middle graph |
| MIN |
| minimal basis |
| minimal forbidden graph family |
| minimal forbidden subgraph family |
| minimal paths |
| minimal ranking |
| minimal rankings |
| minimal reducible bounds |
| minimal separator |
| minimal size |
| minimal subdigraph |
| minimal total dominating functions (MTDFs) |
| minimal trees |
| minimally $2$-connected graph |
| minimally 3-connected |
| minimum coloring |
| minimum congestion spanning tree |
| minimum degree |
| minimum degree two |
| minimum length basis |
| minimum number of trees |
| minimum sum |
| minimum vertex degree |
| min-max theorems |
| minor |
| minor hereditary property |
| minor-free graph |
| minors |
| minus graphs |
| mixed graph |
| mixed hypergraph |
| mixed hypergraphs |
| mixed-weight open locating-dominating sets |
| modular decomposition |
| modular edge-graceful labelings and graphs |
| modular edge-gracefulness |
| modular graph |
| mold |
| monochromatic |
| monochromatic connection coloring (number) |
| monochromatic cycles |
| monochromatic geodesic |
| monochromatic path |
| monochromatic path digraph |
| monochromatic paths |
| monochromatic Ramsey number |
| monocore graph |
| monographs |
| monophonic intervals of sets |
| monophonic number |
| monophonic path |
| Moore bound |
| MOP |
| Motzkin-Straus's inequality |
| multicolor Ramsey number |
| multidigraph |
| multi-dimensional grids |
| multigraph |
| multigraphs |
| multilevel distance labeling |
| multilinear function |
| multipartite graphs |
| multipartite tournament |
| multipartite tournaments |
| multiple domination |
| multiplicative degree-Kirchhoff index |
| multiplicative labelling |
| multiplicity of eigenvalues |
| multiproduct of graphs |
| multiset coloring |
| multiset of labels |
| multivalued mapping |
| mutual-visibility set |
| Mycielski construction |
| Mycielski graph |
| Mycielski graphs |
| Mycielskian |
| Mycielskian graph |
| Mycielskian of graphs |
| Mycielskians |
| N |
| N P-completeness |
| $n$-dimensional cube |
| n-arity |
| n-connected |
| near polynomial growth |
| nearly antipodal chromatic number |
| necklace |
| negative decision number |
| neighbor |
| neighbor full sum distinguishing
total $k$-coloring |
| neighbor product distinguishing coloring |
| neighbor sum distinguishing coloring |
| neighbor sum distinguishing index |
| neighbor sum distinguishing total choosability |
| neighbor sum distinguishing total coloring |
| neighbor-connectivity bound |
| neighbor-distinguishing coloring |
| neighbor-distinguishing index |
| neighborhood |
| neighborhood closure |
| neighborhood color set |
| neighborhood completeness number |
| neighborhood complex |
| neighborhood graph |
| neighborhood polynomial |
| neighborhood reconstructible graphs |
| neighborhood unions and intersections |
| neighbor-locating coloring |
| neighbourhood corona |
| neighbour-sum-distinguishing edge-weightings |
| NEPS of graphs |
| nested split graph |
| net-degree |
| net-regular signed graphs |
| network |
| networks |
| niche graph |
| niche graphs |
| niche hypergraph |
| niche number |
| niche-realizable pair |
| node congestion |
| no-hole coloring |
| non-augmentable path |
| non-dominating partition |
| non-fall colorable graphs |
| non-hamiltonian |
| non-Hamiltonian |
| non-Hamiltonian graph |
| non-regular graphs |
| non-repetitive colouring |
| non-selfcentric |
| nontotal dominating partition |
| nonuniform hypergraph |
| no-rainbow |
| Nordhaus-Gaddum |
| Nordhaus-Gaddum bounds |
| Nordhaus-Gaddum inequalities |
| Nordhaus-Gaddum inequality |
| Nordhaus-Gaddum results |
| Nordhaus-Gaddum type |
| Nordhaus-Gaddum type bounds |
| Nordhaus-Gaddum type result |
| Nordhaus-Gaddum-type result |
| normal Cayley graph |
| normal connection set |
| normal map |
| normal planar map |
| normal plane map |
| nowhere-zero $4$-flow |
| nowhere-zero $k$-flow |
| nowhere-zero flow |
| nowhere-zero labelings |
| np-complete |
| NP-complete |
| NP-complete problems |
| np-completeness |
| NP-completeness |
| np-hard |
| NP-hard |
| NP-hard (complete) |
| nsis number |
| nullity |
| number of spanning trees |
| nut graph |
| O |
| Oberly-Sumner Conjecture |
| Oberwolfach problem |
| object-system |
| obstruction |
| octahedrite |
| ODC |
| odd dominating set |
| odd girth |
| odd hole-free graphs |
| odd induced subgraph |
| odd weights |
| odd-distance graph |
| offensive |
| offensive alliance |
| Ohba's conjecture |
| omnitonal graphs |
| one-factor |
| onerealization |
| one-three join |
| on-line algorithm |
| online arbitrarily partitionable graph |
| online Ramsey games |
| online size Ramsey number |
| on-line vertex colouring |
| open geodetic number |
| open locating-dominating sets |
| open monopolies |
| open packing |
| open packing number |
| open-locating-dominating set |
| optimal pebbling |
| optimal rubbling |
| optimal vector |
| optimality |
| optimization |
| order |
| order of a graph |
| ordered colouring |
| ordered matchings |
| ordering of a graph |
| Ore-type condition |
| orgraph |
| orientation |
| orientations of $K_{4}-e$ |
| oriented $L(2,1)$-labeling |
| oriented chromatic number |
| oriented coloring |
| oriented colouring |
| oriented graph |
| oriented tree |
| orthogonal double cover |
| outer connected domination |
| outer-independent Roman domination |
| outerplanar |
| outerplanar bipartite graph |
| outerplanar graph |
| outerplanar graph. |
| out-neighbourhood |
| outpaths |
| P |
| P3-factor |
| P3-factor covered graph |
| $P_6$-free graphs |
| $P_9$-free graphs |
| packing |
| packing chromatic number |
| packing coloring |
| packing graph |
| packing number |
| packing of digraphs |
| packing of graphs |
| packings of graphs |
| Padovan numbers |
| paired domination |
| paired domination stability |
| paired-domination |
| palette index |
| Pancake graph |
| panchromatic pattern |
| pancyclic |
| pancyclic graph |
| pancyclic graphs |
| pancyclic matroid |
| pancyclicity |
| pancyclism |
| parallel computing |
| parity coloring |
| parity colouring |
| parity domination |
| parity partition |
| partial $k$-tree |
| partial cube |
| partial cubes |
| partial Hamming graph |
| partially square graph |
| partioned domination |
| partition |
| partition into connected subgraphs |
| partition number |
| partition of a graph |
| partition problems |
| path |
| path addition |
| path cover problem |
| path decomposition |
| path embeddings |
| path factor |
| path graph |
| path graphs |
| Path Kernel Conjecture |
| Path Partition Conjecture |
| path-distance-width |
| path-factor |
| path-graph |
| path-induced convexity |
| path-like tree |
| path-neighborhood graph |
| path-pairability |
| path-pairable graphs |
| paths |
| paths and cycles |
| pattern-avoidance |
| P-colouring |
| pdomination |
| p-domination number |
| pendant path |
| pendant tree-connectivity |
| pentagons |
| perfect 2-matching |
| perfect connected-dominant graph |
| perfect digraph |
| perfect dominating set |
| perfect dominating sets |
| perfect edge geodetic set |
| perfect graph |
| perfect graphs |
| perfect Italian domination |
| perfect matching |
| perfect matching polytope |
| perfect matchings |
| perfect neighbourhoods |
| peripheral expansion. |
| periphery |
| permanent |
| permanental polynomial |
| permanental roots |
| permutation |
| permutation graph |
| permutation graphs |
| persistency |
| per-spectrum |
| perturbations |
| petersen graph |
| Petersen graph |
| $P_{\geq k}$-factor |
| $P_{\geq2}$-factor covered graph |
| $P_{\geq3}$-factor covered graph |
| phylogeny graph |
| Pisot numbers |
| placement |
| planar |
| planar triangulation |
| planar graph |
| Planar graph |
| planar graphs |
| planar map |
| planarity |
| plane elementary bipartite graph |
| plane graph |
| plane graphs |
| plane map |
| plane triangulation |
| Platonic solid |
| plick graph |
| point-distinguishing chromatic index |
| Poisson convergence |
| Poissonization |
| polyhedral embedding |
| polyhedral graphs |
| polyhedral maps |
| polyhedron |
| polynomial algorithm |
| polynomial algorithms |
| polynomial function |
| polynomial time |
| polynomial time algorithm |
| polynomial-time algorithm |
| polyomino graph |
| polytopal graphs |
| polytope |
| potential number |
| potentially $K_{s,t}$-bigraphic pair |
| potentially Ks,t-bigraphic pair |
| power hypergraph |
| power and complement of a graph |
| power domination |
| power of a graph |
| power of graphs |
| power of tree |
| power sums |
| powers of a graph |
| powers of a strong oriented graph |
| powers of cycles |
| precoloring extension |
| pre-hull number |
| prescribed vertices |
| pretransitive digraph |
| primary subgraphs |
| prime factor decomposition |
| prime factor theorem |
| prime ideals |
| primitivity |
| primoid |
| principal eigenvector |
| prism |
| prism and web graph |
| prism doubler |
| prism fixer |
| prism graph |
| prism graphs |
| prism of a graph |
| prismatic colouring |
| prisms of graphs |
| probabilistic method |
| probabilistic methods |
| product |
| product connectivity Banhatti index |
| product graph |
| product of digraphs |
| product of graphs |
| product of labels |
| product-irregular labeling |
| products |
| products of graphs |
| projective plane |
| proper colouring |
| proper connection of graphs |
| proper diameter |
| proper edge-coloring |
| proper labelling |
| proper rainbow connection number |
| proper (strong) rainbow connection number |
| properly connected |
| proper-path coloring |
| property |
| property $\Delta^*$ |
| property $\Delta^+$ |
| property of graphs |
| Property of graphs |
| P-set |
| pseudomanifold |
| Ptolemaic graph |
| pursuit |
| pursuit-evasion game |
| pursuit-evasion games |
| P-vertices |
| Q |
| $q$-distance matrix |
| q-analog |
| q-power cycles |
| quadrangle-free graphs |
| quadrangulation |
| quantum information transfer |
| quasi 5-connected |
| quasi color-perfect digraph |
| quasi regular hypergraph |
| quasigroup |
| quasi-Hilbertian graphs |
| quasi-matching |
| quasi-median graph |
| quasi-median graphs |
| quasi-monochromatic digraph |
| quasiperfect dominating set |
| quasi-randomness |
| quasi-transitive digraph |
| quasi-transitivity |
| queens domination problem |
| queens graph |
| R |
| $r$-ciliate |
| $r$-uniform hypergraphs |
| $r$-uniform random hypergraph |
| radial graph |
| radially-maximal |
| radio $k$-coloring |
| radio channel assignment |
| radio channel frequency assignment |
| radio coloring |
| radio colorings |
| radio connection number |
| radio graceful graph |
| radio k-chromatic number |
| radio k-coloring |
| radio k-labeling |
| radio labeling |
| radio number |
| radius |
| radius of graph |
| Radon number |
| rainbow |
| rainbow $S$-tree |
| rainbow coloring |
| rainbow colouring |
| rainbow connection |
| rainbow connection number |
| rainbow connectivity |
| rainbow disconnection |
| rainbow disconnection coloring (number) |
| rainbow dominating function |
| rainbow domination number |
| rainbow index |
| rainbow matching |
| rainbow number |
| rainbow path |
| rainbow tetrahedra |
| Rainbow total-coloring |
| rainbow total-connection number |
| rainbow tree |
| rainbow triangles |
| rainbow vertex-connection |
| rainbow-coloring |
| rainbow-connected graph |
| rainbow-tree |
| Ramsey |
| Ramsey class |
| Ramsey goodness |
| Ramsey minimal graph |
| Ramsey number |
| Ramsey numbers |
| Ramsey property |
| Ramsey theory |
| Ramsey-minimal graphs |
| Randi´c index |
| random digraphs |
| random graph |
| random graphs |
| random intersection graphs |
| random interval graphs |
| random matroids |
| random procedure |
| rank |
| rank number |
| ranking number |
| rankings of graphs |
| rational triangle decompositions |
| realizability |
| realization |
| recognition |
| recognition number |
| recognizable coloring |
| reconfiguration |
| reconstruction |
| reconstruction problem |
| recursively arbitrarily partitionable graph |
| reducibility |
| reducibility. |
| reducible configuration |
| reducible configuration |
| reducible face |
| reducible graph properties |
| reducible property |
| reducible property of graphs |
| reduction |
| reductions |
| redundant distinguishing open-locating-dominating set |
| redundant-identifying-code |
| regular |
| regular 3-partite tournament |
| regular digraph |
| regular factor |
| regular graph |
| regular graphs |
| regular hypergraph |
| regular Ramsey numbers |
| regular signed graph |
| regular tournament |
| regularity |
| reinforcement |
| reinforcement number |
| relaxed DP-colorings |
| relevant circuits |
| remainder |
| removable edge |
| repeated degrees |
| repetition number |
| representation of a graph |
| resistance |
| resistance distance |
| resolving partition |
| resolving set |
| resolving several objects |
| resonant set |
| resource allocation |
| restrained differential |
| restrained domination |
| restrained domination number |
| restrained Roman domination |
| restricted arc-connectivity |
| restricted size Ramsey number |
| right-pretransitive digraph |
| r-maximum k-edge-coloring |
| robust coloring |
| Roman $\{2\}$-bondage number |
| Roman $\{2\}$-domination |
| Roman bondage number |
| Roman dominating function |
| Roman domination |
| Roman domination number |
| rook's graph |
| Rook's graph |
| rooted path graphs |
| rooted product |
| rooted product graphs |
| rotation distance |
| round decomposable |
| round-decomposable |
| S |
| $s$-clique extension |
| $s$-hamiltonian-connected |
| $S$-packing chromatic number |
| saturated graph |
| saturated graphs |
| saturated vertex |
| saturation |
| saturation number |
| saturation spectrum |
| Sauer bound |
| s-bipartite Ramsey number |
| scaling window |
| second out-neighbourhood |
| second Zagreb index |
| secure domination |
| secure total domination |
| segregated labelings |
| selective |
| self-centered graph with radius 2 |
| self-centered graphs |
| self-complementary graph |
| selfcomplementary graphs |
| self-complementary hypergraph |
| self-complementary hypergraphs |
| self-complementing permutation |
| selfdual |
| self-orthogonal factorization |
| semicubic graphs |
| semicycle in hypergraph |
| semikernel |
| semikernel of D modulo i by monochromatic paths |
| semikernels |
| semi-matching |
| semipaired domination |
| semipaired domination number |
| semisymmetric graph |
| semitotal domination |
| semitotal forcing number |
| semi-total line sigraph |
| semi-total point sigraph |
| semi-transitive graph |
| semi-transitive orientation |
| separating set |
| separator theorem |
| sequential labelling |
| set chromatic number |
| set coloring |
| set systems |
| Sevastjanov graph |
| shadow |
| shadow function |
| sharp upper bounds |
| shift transformation |
| short cycle |
| shortest path |
| shortness coefficient |
| shortness exponent |
| Sidon sequence |
| Sierpi\'{n}ski graphs |
| Sierpin´ski graphs |
| sigma labeling |
| sign-balanced graph |
| 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 graphs |
| signed k-independence |
| signed line graph |
| signed matching |
| signed matching number |
| signed Roman edge k-dominating function |
| signed Roman edge k-domination number |
| signed Roman k-dominating function |
| signed Roman k-domination number |
| signed total domination number |
| signed total k-dominating function |
| signed total k-domination number |
| signed total (k,k)-domatic number |
| signed total Roman dominating function |
| signed total Roman domination number |
| signed total Roman edge dominating function |
| signed total Roman edge domination number |
| signed total Roman k-domatic number |
| signed total Roman k-dominating function |
| signed total Roman k-domination number |
| signless Laplacian |
| signless Laplacian matrix |
| signless Laplacian spectral radius |
| signpost system |
| sign-unbalanced graph |
| sigraph |
| simple eigenvalue |
| simple-triangle graphs |
| simplex |
| simplex of a graph |
| simplex operator |
| simplicial clique |
| simplicial complex |
| simply (k-)sequentially additive labelings (graphs) |
| single bend paths |
| singless Laplacian spectral radius |
| singular |
| singular graph |
| singular Tur\'an numbers |
| sirth |
| size of graph |
| size Ramsey number |
| Skolem sequence |
| Slater number |
| Slobodan Simi´c |
| S-magic graph |
| S-magic labeling |
| small graph |
| smallest eigenvalue |
| Smith graphs |
| snake |
| snark |
| solution of digraph |
| solution space enumeration |
| $SP_{5}$-free graphs |
| span |
| span of a graph |
| spaning tree |
| spanning cyclable |
| spanning eulerian subdigraph |
| spanning graph |
| spanning subgraph |
| spanning tree |
| spanning tree congestion |
| spanning trees |
| spanning Tur\'{a}n problem |
| sparse graphs |
| special super edge-magic labeling |
| specialized bi-independent covering (SBIC) |
| spectral bounds |
| spectral characterization |
| spectral decomposition |
| spectral integral variation |
| spectral radius |
| spectrum |
| spectrum problem |
| Sperner lemma |
| sphere of influence graph |
| spider |
| split decomposition |
| split domination number |
| split Euler tour |
| split graph |
| split graphs |
| splitting |
| splitting operation |
| square |
| square graph |
| square grid graph |
| square grids |
| s-regular Cayley graph |
| stability |
| stability number |
| stable |
| stable graph |
| stable graphs |
| stable matching |
| stable perfect matching |
| stable set |
| stable sets |
| Stanley's bound |
| star |
| star chromatic index |
| star chromatic number |
| star coloring |
| star complement |
| star convex bipartite graph |
| star edge-coloring |
| star factor |
| star forests |
| star partitions |
| star-critical Ramsey number |
| star-critical Ramsey numbers |
| star-cycle factor |
| star-free |
| star-like network |
| star-like trees |
| stars |
| state splitting |
| Steinberg conjecture |
| Steiner convexity |
| Steiner distance |
| Steiner number |
| Steiner system |
| Steiner tree |
| Steiner Wiener index |
| Steiner Wiener kindex |
| stem |
| stratified graph |
| stretch number |
| strictly perfect digraph |
| strip |
| striped maximal outerplanar graphs |
| strong beta-number |
| strong chromatic index |
| strong circular P-chromatic number |
| strong digraph |
| strong edge coloring |
| strong edge-coloring |
| strong equality |
| strong geodetic number |
| strong geodetic set |
| strong graph product |
| strong Helly |
| strong incidence colouring |
| strong matching |
| strong metric basis |
| strong metric dimension |
| strong metric generator |
| strong parity vertex colouring |
| Strong Path Partition Conjecture |
| Strong Perfect Graph Theorem |
| strong p-Helly graph |
| strong product |
| strong product graphs |
| strong proper-path coloring |
| strong rainbow connection |
| strong subgraph |
| strong subgraph $k$-connectivity |
| strong subgraph arc-connectivity |
| strongly chordal graph |
| strongly chordal graphs |
| strongly independent set |
| strongly multiplicative graphs. |
| strongly perfect graphs |
| strongly polynomial-time |
| strongly regular signed graph |
| structural characterization |
| structural properties |
| structural property |
| structural theorem |
| structure |
| structure properties |
| structured parallel compute |
| sub-$k$-domination number |
| subcubic graph |
| subcubic graphs |
| subdigraph packing |
| subdirect representations of graphs |
| subdivision |
| subdivision |
| subdivision graph |
| subdivision number |
| subdivision numbers |
| subdivision of stars |
| subgraph |
| subgraph identification |
| submultiplicative |
| subtree intersection representation |
| Suen’s inequality |
| sum choice index |
| sum choice number |
| sum hypergraphs |
| sum list coloring |
| sum list edge coloring |
| sum number |
| sum of labels |
| sum-list colouring |
| sunflower hypergraph |
| super (a,d)-EAT labeling |
| super (a,d)-H-antimagic total labeling |
| super edge-antimagic labeling |
| super edge-connected |
| super edge-magic labeling |
| super krestricted edge connected graph |
| super-$\lambda'$ |
| super-connectivity |
| super-edge-connected graphs |
| supereulerian |
| supereulerian digraph |
| super-extension |
| superior edge geodetic set |
| supermagic graphs |
| super-magic labeling |
| supermagic labeling |
| supermultiplicative |
| super-restricted arcconnectivity |
| surface |
| surplus |
| switching class |
| switching classes |
| switching equivalence |
| switching method |
| symmetric dominating set |
| symmetric graphs |
| symmetric group |
| symmetric Hamilton cycle |
| symmetric power of a graph |
| T |
| T -coloring |
| $T$-coloring |
| tame mold |
| tandem-win |
| target set selection process |
| T-distance |
| telecommunications network |
| telephone numbers |
| tensor |
| tensor graph product |
| tensor product |
| tensor products |
| T-factorization |
| T-geodesic |
| the color-class digraph |
| the de Bruijn graph |
| The Directed Hamilton-Waterloo Problem |
| the fourth character |
| the second smallest real root |
| the smallest real root |
| the X-join of graphs |
| theta graph |
| thickness |
| thin triangular grid cylinder graph |
| threshold dimension |
| threshold graph |
| threshold graphs |
| thresholds |
| Thue chromatic number |
| tight hypergraphs |
| tight tournament |
| Toeplitz graph |
| Toft's graph |
| token graph |
| topological graph theory |
| toroidal chessboards |
| toroidal graph |
| toroidal grid |
| torus |
| total $2$-domination number |
| total $\{2\}$-domination number |
| total $2$-limited packing number |
| total $2$-rainbow dominating function |
| total $2$-rainbow domination number |
| total $H$-irregularity strength |
| total $\{k\}$-domatic number |
| total $\{k\}$-dominating function |
| total $k$-domination |
| total $\{k\}$-domination number |
| total acquisition number |
| total assignment |
| total choice number |
| total choosability |
| total chromatic number |
| total coalition graph |
| total coalition number |
| total coalition partition |
| total coloring |
| total coloring conjecture |
| total colouring |
| total covering |
| total domatic number |
| total dominating set |
| total domination |
| total domination number |
| total domination quotient |
| total domination stability |
| total domination subdivision number |
| total double Roman domination |
| total edge irregularity strength |
| total forcing number |
| total forcing set |
| total graph |
| total graphs |
| total irredundance |
| total irregularity of graphs |
| total k-domination |
| total k-subdomination |
| total labellings |
| total limited packing |
| total monochromatic connection |
| total mutual-visibility set |
| total outer-connected domination number |
| total rainbow connection |
| total restrained domination |
| total restrained domination number |
| total Roman $\{2\}$-domination |
| total Roman dominating function |
| total Roman domination number |
| total Roman reinforcement number |
| total (signed) domination number |
| total vertex irregularity strength |
| total vertex product irregularity strength |
| total weak Roman domination |
| total-colored graph |
| total-coloring |
| total-coloring,discharging method |
| totally multicoloured |
| toughness |
| tour girth |
| tournament |
| tournaments |
| $T_p$-tree |
| T-path |
| trace |
| traceability |
| traceable |
| traceable from every vertex |
| traceable graph |
| traceable graphs |
| trail |
| transfer matrix method |
| transit function |
| transitive digraph |
| transitive digraph, |
| transitive graphs |
| transitive tournament |
| transpositions |
| transversal |
| transversal number |
| transversal set |
| traveling salesman problem |
| travelling salesman problem |
| travers-ability |
| tree |
| tree connectivity |
| tree graph |
| tree packing |
| tree-achieving number |
| trees |
| tree-width |
| treewidth |
| t-restricted optimal pebbling |
| triangle avoidance game |
| triangle decompositions |
| triangle-free graph |
| triangle-free graphs |
| triangle-star |
| triangle-tree |
| triangular graph |
| triangular grid |
| triangular ladder |
| triangular lattice |
| triangulated surface |
| triangulation |
| triangulations |
| tricyclic graph |
| tripartite graph |
| triple Roman domination |
| triple systems |
| tripod |
| trivially perfect graph |
| true twins |
| tuple domination |
| tuple total domination number |
| Tur´an function |
| Tur\'{a}n number |
| Tur\'an number |
| Tur´an number |
| Tur´an numbers |
| Tur\'an problems |
| Tur\'an-good |
| Tur\'{a}n's theorem |
| Tutte polynomial |
| Tutte type condition |
| Tutte-path |
| twin minus total dominating function |
| twin minus total domination number |
| twin subsets |
| twin-free graph |
| twins |
| two paths problem |
| two-factor |
| two-fold isomorphism |
| two-player games |
| two-point concentration |
| type of a face |
| U |
| unavoidable set |
| uncolorable cubic graph |
| uncovering |
| underlying graph |
| undirected graph |
| undirected path graphs |
| unfriendly partition |
| unichord-free graph |
| unicyclic graph |
| unicyclic graphs |
| unicyclic hypergraph |
| uniform clutters |
| uniform hypergraph |
| uniform hypergraph, |
| union of graphs |
| unique colorability |
| unique factorization |
| unique k-factor |
| unique maximum packing |
| uniquely quasi-transitively colourable graphs |
| uniquely 3-list colorable graph |
| uniquely embeddable graphs |
| uniquely H-colourable |
| uniquely partitionable graphs |
| uniquely partitionable planar graphs |
| uniquely partitionable system |
| unique-maximum coloring |
| unique-maximum edge-coloring |
| unitary Cayley graph |
| unit-distance graph |
| universal fixer |
| universal graphs |
| universal line |
| 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 |
| V |
| $V_4$-cordial graph |
| $V_8$ |
| $V_{8}^{--}$-minor-free |
| value of a $\gamma$-labeling |
| variable degeneracy |
| variety |
| vector chromatic number |
| vertex 3-colouring |
| vertex coloring |
| vertex colouring |
| vertex connectivity |
| vertex cover |
| vertex cover number |
| vertex cover P3 problem |
| vertex degree |
| vertex detour number |
| vertex disjoint copy |
| vertex disjoint cycles |
| vertex domination |
| vertex independence |
| vertex irregular total $k$-labeling |
| vertex irregular total labeling |
| vertex labeling |
| vertex labelling |
| vertex monophonic number |
| vertex ordering |
| vertex ordering characterization |
| vertex partition |
| vertex partition number |
| vertex PI index |
| vertex position number |
| vertex position set |
| vertex ranking |
| vertex removal critical graphs |
| vertex removal stable graphs. |
| vertex resistance |
| vertex stable graph |
| vertex-coloring |
| vertex-colouring |
| vertex-connectivity |
| vertex-critical |
| vertex-critical r-dichromatic tournament |
| vertex-deleted subgraph |
| vertex-disjoint copies |
| vertex-disjoint cycle |
| vertex-distinguishing edge-coloring |
| vertex-distinguishing IE-total chromatic number |
| vertex-distinguishing IE-total coloring |
| vertex-distinguishing labeling |
| vertex-dominating cycle |
| vertex-edge dominating set |
| vertex-edge domination |
| vertex-intersection graph of paths in a tree |
| vertex-magic total labeling |
| vertex-rainbow connection number |
| vertexrainbow index |
| vertex-rainbow path |
| vertex-rainbow S-tree |
| vertex-symmetric directed graph |
| vertex-symmetric graph |
| vertex-to-edge median |
| vertex-transitive $k$-hypergraphs |
| vertex-transitive graph |
| vertex-weighted graphs |
| vertex-weighting |
| Vizing's conjecture |
| Vizing`s conjecture |
| VO |
| voltage permutation graph |
| VPG |
| W |
| Walecki decomposition |
| Walecki tournaments |
| walk |
| walk double cover |
| walk matrix |
| walks |
| watchman's walk |
| Weak $(2,2)$-Conjecture |
| weak Cartesian product |
| weak dual |
| weak linkage |
| weak parity vertex colouring |
| Weak Perfect Graph Theorem |
| weak Roman domination |
| weak Roman domination number |
| weak saturation |
| weak total metric dimension |
| weak total resolving set |
| weak-cores |
| weak-even edge-coloring |
| weak-extreme vertex |
| weakly connected domination number |
| weakly connected domination subdivision number |
| weakly convex domination number |
| weakly geodetic graph |
| weakly pancyclic |
| weakly pancyclicity |
| weakly saturated graphs |
| weakly universal graph |
| weakly-modular graph |
| weak-odd edge-coloring |
| weak-parity coloring |
| weak-retract |
| Wegner's conjecture |
| weighing matrix |
| weight |
| weight of a graph |
| weight of a path |
| weight of an edge |
| weight of face |
| weight of path |
| weighted codes |
| weighted degree |
| weighted dgph |
| weighted graph |
| well-covered |
| well-covered dimension |
| well-covered graph |
| well-dominated graphs |
| well-spread sequence |
| wheel |
| wheel graph |
| wheels |
| Whitney's isomorphism theorem |
| Wiener distance |
| Wiener graphical |
| Wiener index |
| Wiener index of a graph |
| Wiener number |
| winnability |
| word-representability |
| word-repre\-sentable graph |
| WORM coloring |
| WORM-coloring |
| wreath product |
| X |
| $x$-detour hull number |
| $x$-detour number |
| Xuong-tree |
| Z |
| Zagreb eccentricity index |
| Zagreb indices |
| zero forcing |
| zero forcing number |
| zero forcing sets |
| zero-sum Ramsey |
| zeroth-order Randi\'{c} index |
| ZF-dense |
| Zykov sums |
| Zykov symmetrization |
| Zykov's symmetrization |