On a Problem in Graph Theory
From MaRDI portal
Publication:5727295
DOI10.2307/3613396zbMath0117.17402OpenAlexW103919602MaRDI QIDQ5727295
Publication date: 1963
Published in: The Mathematical Gazette (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/854f691c8358dba93ccc9f3daff7624252491b37
Related Items (27)
Kolmogorov complexity arguments in combinatorics ⋮ Distance and eccentricity based invariants of windmill graph ⋮ Derandomizing restricted isometries via the Legendre symbol ⋮ Probabilistic methods ⋮ Computing first and second fuzzy Zagreb indices of linear and multiacyclic hydrocarbons ⋮ Directed domination in oriented hypergraphs ⋮ On finding a minimum dominating set in a tournament ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ The watchman's walk problem on directed graphs ⋮ The duality gap for two-team zero-sum games ⋮ Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs ⋮ Ranking graphs through hitting times of Markov chains ⋮ \(k\)-ary spanning trees contained in tournaments ⋮ Directed domination in oriented graphs ⋮ On an adjacency property of almost all tournaments ⋮ A greedy partition lemma for directed domination ⋮ A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) ⋮ On explicit random-like tournaments ⋮ Random constructions and density results ⋮ Bounded time-stamps ⋮ Domination in Digraphs ⋮ Margin of victory for tournament solutions ⋮ Approximate counting by hashing in bounded arithmetic ⋮ Packing and domination parameters in digraphs ⋮ Locating-dominating sets: from graphs to oriented graphs ⋮ Unnamed Item ⋮ Orientable domination in product-like graphs
This page was built for publication: On a Problem in Graph Theory
