The following pages link to Gregory Gutin (Q168084):
Displayed 50 items.
- A note on the cardinality of certain classes of unlabeled multipartite tournaments (Q1584288) (← links)
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs (Q1584322) (← links)
- Upper domination and upper irredundance perfect graphs (Q1584381) (← links)
- Note on alternating directed cycles (Q1584433) (← links)
- On score sequences of \(k\)-hypertournaments (Q1590213) (← links)
- Subdivisions of transitive tournaments (Q1590220) (← links)
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
- Anti-matroids (Q1612010) (← links)
- Graphs having distance-\(n\) domination number half their order (Q1613368) (← links)
- The cycle structure of regular multipartite tournaments (Q1613369) (← links)
- Orientations of digraphs almost preserving diameter (Q1613394) (← links)
- Total domination in complements of graphs containing no \(K _{4,4}\) (Q1613536) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
- Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming (Q1759676) (← links)
- When \(n\)-cycles in \(n\)-partite tournaments are longest cycles (Q1763349) (← links)
- On the kings and kings-of-kings in semicomplete multipartite digraphs (Q1772420) (← links)
- Batched bin packing (Q1779689) (← links)
- Changing upper irredundance by edge addition (Q1810642) (← links)
- Defending the Roman Empire---a new strategy (Q1810648) (← links)
- All regular multipartite tournaments that are cycle complementary (Q1827717) (← links)
- Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments (Q1827718) (← links)
- The structure of strong arc-locally semicomplete digraphs (Q1827761) (← links)
- Weakly Hamiltonian-connected ordinary multipartite tournaments (Q1842145) (← links)
- Game domination number (Q1849910) (← links)
- Whitney triangulations, local girth and iterated clique graphs (Q1850046) (← links)
- Longest paths through an arc in strong semicomplete multipartite digraphs (Q1850069) (← links)
- Independence, irredundance, degrees and chromatic number in graphs (Q1861218) (← links)
- Almost minimum diameter orientations of semicomplete multipartite and extended digraphs (Q1865138) (← links)
- Extendable cycles in multipartite tournaments (Q1889827) (← links)
- Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs (Q1894766) (← links)
- A simple a. s. correct algorithm for deciding if a graph has a perfect matching (Q1902903) (← links)
- A complete solution of a problem of Bondy concerning multipartite tournaments (Q1907115) (← links)
- Kings in multipartite tournaments (Q1910515) (← links)
- On the complexity of recognizing Hamming graphs and related classes of graphs (Q1911841) (← links)
- The cordiality of the path-union of \(n\) copies of a graph (Q1916396) (← links)
- On the structure of trapezoid graphs (Q1917308) (← links)
- Ranking the vertices of a complete multipartite paired comparison digraph (Q1923602) (← links)
- A new operation on sequences: The boustrophedon transform (Q1924235) (← links)
- (Non-)existence of polynomial kernels for the test cover problem (Q1943629) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- On optimal orientations of Cartesian products with a bipartite graph (Q1961236) (← links)
- On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles (Q1969779) (← links)
- Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian (Q1970581) (← links)
- On the Hajós number of graphs (Q1970708) (← links)
- Bipartite covering graphs (Q1972129) (← links)
- Perfection thickness of graphs (Q1974539) (← links)
- Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games (Q2019479) (← links)