On a Problem in Graph Theory
From MaRDI portal
Recommendations
Cited in
(44)- Random constructions and density results
- A problem on algebraic graph theory
- Probabilistic methods
- On finding a minimum dominating set in a tournament
- Bounded time-stamps
- Kolmogorov complexity arguments in combinatorics
- A contribution to a problem of directed graphs
- On explicit random-like tournaments
- Margin of victory for tournament solutions
- Locating-dominating sets: from graphs to oriented graphs
- Orientable domination in product-like graphs
- Computing first and second fuzzy Zagreb indices of linear and multiacyclic hydrocarbons
- \(k\)-ary spanning trees contained in tournaments
- Packing and domination parameters in digraphs
- The duality gap for two-team zero-sum games
- On an adjacency property of almost all tournaments
- A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\)
- Derandomizing restricted isometries via the Legendre symbol
- scientific article; zbMATH DE number 5881230 (Why is no real title available?)
- scientific article; zbMATH DE number 3868663 (Why is no real title available?)
- Domination in digraphs
- Approximate counting by hashing in bounded arithmetic
- scientific article; zbMATH DE number 15129 (Why is no real title available?)
- Directed domination in oriented graphs
- scientific article; zbMATH DE number 1958588 (Why is no real title available?)
- scientific article; zbMATH DE number 6866346 (Why is no real title available?)
- On Four Problems in Graph Theory
- The watchman's walk problem on directed graphs
- Distance and eccentricity based invariants of windmill graph
- Directed domination in oriented hypergraphs
- Binary Covering Arrays and Existentially Closed Graphs
- Covering 2‐colored complete digraphs by monochromatic d d‐dominating digraphs
- Ranking graphs through hitting times of Markov chains
- Chromatic number is not tournament-local
- Orientable burning number of graphs
- Turán problems for oriented graphs
- A greedy partition lemma for directed domination
- 2- and 3-existentially closed tournaments
- Orientable total domination in graphs
- On the complexity of Maslov's class K
- Orientable burning number of graphs
- Tournaments, Johnson graphs and NC-teaching
- About kings and dominating sets in tournaments
- The existence of C₄-saturated graphs having sizes close to the lower bound
This page was built for publication: On a Problem in Graph Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5727295)
