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