In-tournament digraphs

DOI10.1006/JCTB.1993.1069MaRDI QIDQ1322037zbMATH OpenOpenAlexFDO

Authors Jing Huang, Erich Prisner, 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

zbMATH Keywords

pathsHamiltonian cyclecyclespolynomial algorithmin-tournament digraphslinegraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• scientific article; zbMATH DE number 403948
• scientific article; zbMATH DE number 1334633
• On the structure of local tournaments

Cited in

(31)

• Obstructions for acyclic local tournament orientation completions
• Interval Tournaments
• Cycles in \(k\)-traceable oriented graphs
• Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments
• \(\alpha\)-diperfect digraphs
• A characterization of normal fraternally orientable perfect graphs
• Partial characterizations of 1-perfectly orientable graphs
• On powers of circular arc graphs and proper circular arc graphs
• Basic Terminology, Notation and Results
• On arc-traceable local tournaments
• On the number of nonseparating vertices in strongly connected in-tournaments
• Pancyclic orderings of in-tournaments
• Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments
• Vertex 6-pancyclic in-tournaments
• Vertex pancyclic in-tournaments
• All 2-connected in-tournaments that are cycle complementary
• Pancyclic orderings of in-tournaments
• Digraphs with the path‐merging property
• Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
• Independent sets and non-augmentable paths in generalizations of tournaments
• Recognition and characterization of chronological interval digraphs
• Perfect graphs, kernels, and cores of cooperative games
• Treewidth versus clique number. I: Graph classes with a forbidden structure
• Avoidable vertices and edges in graphs: existence, characterization, and applications
• Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
• A sufficient condition for a digraph to be positive-round
• 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
• Locally Semicomplete Digraphs and Generalizations
• 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs
• Forbidden tournaments and the orientation completion problem
• \(1\)-perfectly orientable graphs and graph products

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)