In-tournament digraphs
From MaRDI portal
Publication:1322037
DOI10.1006/jctb.1993.1069zbMath0794.05033OpenAlexW1972280932MaRDI QIDQ1322037
Erich Prisner, Jing Huang, Jörgen Bang-Jensen
Publication date: 17 August 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1993.1069
Related Items (26)
Pancyclic orderings of in-tournaments ⋮ Vertex 6-pancyclic in-tournaments ⋮ A characterization of normal fraternally orientable perfect graphs ⋮ Unnamed Item ⋮ Vertex pancyclic in-tournaments ⋮ On powers of circular arc graphs and proper circular arc graphs ⋮ 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs ⋮ Recognition and characterization of chronological interval digraphs ⋮ A sufficient condition for a digraph to be positive-round ⋮ Independent sets and non-augmentable paths in generalizations of tournaments ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ Cycles in \(k\)-traceable oriented graphs ⋮ 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs ⋮ \(1\)-perfectly orientable graphs and graph products ⋮ All 2-connected in-tournaments that are cycle complementary ⋮ Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments ⋮ Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments ⋮ On arc-traceable local tournaments ⋮ Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem ⋮ Avoidable vertices and edges in graphs: existence, characterization, and applications ⋮ Basic Terminology, Notation and Results ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure ⋮ \(\alpha\)-diperfect digraphs ⋮ Partial Characterizations of 1‐Perfectly Orientable Graphs
This page was built for publication: In-tournament digraphs
