The following pages link to In-tournament digraphs (Q1322037):
Displayed 26 items.
- Recognition and characterization of chronological interval digraphs (Q396800) (← links)
- 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs (Q510581) (← links)
- \(1\)-perfectly orientable graphs and graph products (Q526271) (← links)
- Cycles in \(k\)-traceable oriented graphs (Q641171) (← links)
- On arc-traceable local tournaments (Q998389) (← links)
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem (Q1272469) (← links)
- A characterization of normal fraternally orientable perfect graphs (Q1357743) (← links)
- Pancyclic orderings of in-tournaments (Q1613377) (← links)
- Vertex 6-pancyclic in-tournaments (Q1877667) (← links)
- On powers of circular arc graphs and proper circular arc graphs (Q1923580) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- \(\alpha\)-diperfect digraphs (Q2113335) (← links)
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs (Q2413965) (← links)
- Independent sets and non-augmentable paths in generalizations of tournaments (Q2427505) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- All 2-connected in-tournaments that are cycle complementary (Q2483393) (← links)
- Vertex pancyclic in-tournaments (Q2707976) (← links)
- (Q2741368) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- A sufficient condition for a digraph to be positive-round (Q3498597) (← links)
- Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments (Q3605164) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments (Q5189241) (← links)
- Partial Characterizations of 1‐Perfectly Orientable Graphs (Q5272923) (← links)
- Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs (Q5505675) (← links)