In-tournament digraphs
We introduce a generalization of digraphs that are local tournaments. This is the class of in-tournament digraphs---the set of predecessors of every vertex induces a tournament. We show that many properties of local tournament digraphs can be extended even to in-tournament digraphs. For instance, any strongly connected in-tournament digraph has a directed Hamiltonian cycle. We prove that the underlying graph of any in- tournament digraph is 1-homotopic. We investigate the problem of which graphs are orientable as in-tournament digraphs and prove that any graph representable as an intersection subgraph of a unicyclic graph can be so oriented. It is shown that there is a polynomial algorithm for recognizing those graphs that can be oriented as in-tournament digraphs.
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
- A characterization of normal fraternally orientable perfect graphs
- Pancyclic orderings of in-tournaments
- Vertex 6-pancyclic in-tournaments
- On powers of circular arc graphs and proper circular arc graphs
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Obstructions for acyclic local tournament orientation completions
- \(\alpha\)-diperfect digraphs
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
- Independent sets and non-augmentable paths in generalizations of tournaments
- Perfect graphs, kernels, and cores of cooperative games
- All 2-connected in-tournaments that are cycle complementary
- Vertex pancyclic in-tournaments
- Pancyclic orderings of in-tournaments
- Basic Terminology, Notation and Results
- Locally Semicomplete Digraphs and Generalizations
- A sufficient condition for a digraph to be positive-round
- Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments
- On the number of nonseparating vertices in strongly connected in-tournaments
- Recognition and characterization of chronological interval digraphs
- scientific article; zbMATH DE number 1334633 (Why is no real title available?)
- Digraphs with the path‐merging property
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs
- Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments
- \(1\)-perfectly orientable graphs and graph products
- Partial characterizations of 1-perfectly orientable graphs
- Interval Tournaments
- Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
- Cycles in \(k\)-traceable oriented graphs
- Forbidden tournaments and the orientation completion problem
- An algebraic proof of the dichotomy for graph orientation problems with forbidden tournaments
- (k,H)-kernels in nearly tournaments
- Orientations without forbidden patterns on three vertices
- On arc-traceable local tournaments
This page was built for publication: In-tournament digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322037)
