The following pages link to Gregory Gutin (Q168084):
Displayed 50 items.
- A new sufficient condition for a digraph to be Hamiltonian (Q1302145) (← links)
- Tree- and forest-perfect graphs (Q1302153) (← links)
- On the extension of bipartite to parity graphs (Q1302156) (← links)
- Exponential neighbourhood local search for the traveling salesman problem (Q1302597) (← links)
- Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour (Q1302598) (← links)
- Shortness parameters for polyhedral graphs (Q1304819) (← links)
- On conjectures of Berge and Chvátal (Q1313827) (← links)
- On simple MCD graphs containing a subgraph homeomorphic to \(K_ 4\) (Q1318821) (← links)
- Maximality of the cycle code of a graph (Q1322205) (← links)
- On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs (Q1323492) (← links)
- On cycles in multipartite tournaments (Q1325269) (← links)
- Two-trees optimal \(T\)-join and integral packing of \(T\)-cuts (Q1333320) (← links)
- On packing \(T\)-cuts (Q1333344) (← links)
- The dual of the Ahlswede-Zhang identity (Q1336455) (← links)
- Minimizing and maximizing the diameter in orientations of graphs (Q1340120) (← links)
- Maximizing traveling salesman problem for special matrices (Q1343160) (← links)
- Using local adaptations to reconfigure a spanning tree of a network (Q1345965) (← links)
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP (Q1348379) (← links)
- A note on alternating cycles in edge-coloured graphs (Q1354729) (← links)
- A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian (Q1356402) (← links)
- A classification of locally semicomplete digraphs (Q1356448) (← links)
- Recognizing Cartesian graph bundles (Q1356477) (← links)
- The number of kings in a multipartite tournament (Q1356480) (← links)
- Vertex heaviest paths and cycles in quasi-transitive digraphs (Q1356546) (← links)
- On \(k\)-strong and \(k\)-cyclic digraphs (Q1356647) (← links)
- Paths and cycles in extended and decomposable digraphs (Q1356688) (← links)
- A note on the minimum size of a vertex pancyclic graph (Q1356690) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- Unified all-pairs shortest path algorithms in the chordal hierarchy (Q1364781) (← links)
- Optimal orientations of products of paths and cycles (Q1377664) (← links)
- Generalizations of the \(q\)-Morris constant term identity (Q1380337) (← links)
- An interpretation for Garsia and Remmel's \(q\)-hit numbers (Q1380346) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- Properly coloured Hamiltonian paths in edge-coloured complete graphs (Q1383382) (← links)
- Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs (Q1392551) (← links)
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs (Q1405121) (← links)
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs (Q1405122) (← links)
- A class of perfect graphs containing \(P_{6}\) (Q1405124) (← links)
- Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
- Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
- On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs (Q1406558) (← links)
- \(c\)-pancyclic partial ordering and \((c-1)\)-pan-outpath partial ordering in semicomplete multipartite digraphs. (Q1421090) (← links)
- Relations between the lower domination parameters and the chromatic number of a graph. (Q1421509) (← links)
- Extracting pure network submatrices in linear programs using signed graphs. (Q1427813) (← links)
- Detecting embedded networks in LP using GUB structures and independent set algorithms (Q1567484) (← links)
- Clique covering the edges of a locally cobipartite graph (Q1567657) (← links)
- A Fan-type condition for claw-free graphs to be Hamiltonian (Q1567673) (← links)
- Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian (Q1569076) (← links)
- Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs (Q1579571) (← links)
- A determinant of the Chudnovskys generalizing the elliptic Frobenius-Stickelberger-Cauchy determinantal identity (Q1583623) (← links)