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