| 1x | | price of connectivity, readability, cycle transversal, path transversal, overlap graph, integer linear program, two-dimensional grid graphs, toroidal grid graphs, HUB-number, decomposition, strong product, distinctness, labeling, lexicographic product, interval graph, circular arc graph, chordal graph, structural characterization of families of graphs, linearen hipergraf, 1-perfectly orientable graph, cograph, block-cactus graph, Cartesian product, hereditaren grafovski razred, graph product, outerplanar graph, cobipartite graph, K4-minor-free graph, direct product, dominantno pragoven graf, popolni grafi, izrek o popolnih grafih, problem samih enic, liho dominantna množica, hevrističen algoritem, dominantna množica, osnovni razredi popolnih grafov, podvojitev kocke, polynomial algorithm, equistable graph, independent set, dualnost, kvadratura kroga, trisekcija kota, problem mešane popolne filogenije, problem barvanja grafov, ekvistarabilen graf, k-prirejanje, ekvistabilen graf, povezana dominantna množica, Saksa in Seymourja, totalno dominantna množica, k-razširljivost, k-notranje razširljiv graf, popolna filogenija, NP-težek problem, submodular function maximization, submodular function, kartezični produkt grafov, combinatorial optimization, pragoven graf, domneva Erdősa, razvoj mutacij v tumorju, celoštevilsko linearno programiranje, popolna logenija, dichotomy theorem, polynomial-time algorithm, NP-complete problem, CPLEX, perfect phylogeny, chain partition, Dilworth's theorem, acyclic digraph, branching, minimum conflict-free row split problem, minimum uncovering branching problem, distance k-edge cover, distance-k vertex cover, tree decomposition, treewidth, alghorithms, structure, independet sets, graph classes, tree-independence number, induced minor, distance-k dominating set, distance-k edge dominating set, linearna algebra, pragovni grafi, series parallel graph, kartezični produkt, leksikografski produkt, barvanje povezav, kromatično število, barvanje točk, izrek o grafovskih minorjih, izrek Kuratowskega, minor, kromatični indeks, popoln graf, minimal separators, Faberja in Lovász, kromatično število grafa, mathematical modelling, university timetabling, NP-completeness, subdivizija, ravninska vložitev, Boolova funkcija, metoda prepoznavanja matematičnih vzorcev, graf, 1-popolna usmeritev, direktni produkt, krepki produkt, dualen sistem, graph, greedy heuristic, ravninski graf, submodular set covering problem, vector connectivity, vector domination, domneva Alona |
