The following pages link to On a Problem in Graph Theory (Q5727295):
Displaying 36 items.
- Derandomizing restricted isometries via the Legendre symbol (Q295815) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- A greedy partition lemma for directed domination (Q665996) (← links)
- Random constructions and density results (Q1009013) (← links)
- A problem on algebraic graph theory (Q1062995) (← links)
- Probabilistic methods (Q1091406) (← links)
- On finding a minimum dominating set in a tournament (Q1113678) (← links)
- Bounded time-stamps (Q1261108) (← links)
- Kolmogorov complexity arguments in combinatorics (Q1328399) (← links)
- A contribution to a problem of directed graphs (Q1570888) (← links)
- On explicit random-like tournaments (Q2042219) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
- Orientable domination in product-like graphs (Q2109114) (← links)
- Computing first and second fuzzy Zagreb indices of linear and multiacyclic hydrocarbons (Q2138145) (← links)
- \(k\)-ary spanning trees contained in tournaments (Q2197413) (← links)
- Packing and domination parameters in digraphs (Q2328107) (← links)
- The duality gap for two-team zero-sum games (Q2416652) (← links)
- On an adjacency property of almost all tournaments (Q2433700) (← links)
- A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) (Q2490871) (← links)
- (Q2995577) (← links)
- Domination in Digraphs (Q3384119) (← links)
- Approximate counting by hashing in bounded arithmetic (Q3399180) (← links)
- (Q3977472) (← links)
- (Q4416560) (← links)
- (Q4638111) (← links)
- On Four Problems in Graph Theory (Q4722099) (← links)
- The watchman's walk problem on directed graphs (Q5000299) (← links)
- Distance and eccentricity based invariants of windmill graph (Q5036725) (← links)
- Directed domination in oriented hypergraphs (Q5242948) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs (Q6057898) (← links)
- Ranking graphs through hitting times of Markov chains (Q6074655) (← links)
- Chromatic number is not tournament-local (Q6564606) (← links)
- Orientable burning number of graphs (Q6575409) (← links)
- Turán problems for oriented graphs (Q6644281) (← links)
