Forbidden tournaments and the orientation completion problem

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Applications of model theory (03C98) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Infinite graphs (05C63)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
The complexity of satisfiability problems: Refining Schaefer's theorem
In-tournament digraphs
The wonderland of reflections
Minimal functions on the random graph
Describing hereditary properties by forbidden circular orderings
ASNP: a tame fragment of existential second-order logic
Two-element structures modulo primitive positive constructability
Constraints, MMSNP and expander relational structures
Closed systems of functions and predicates
Complexity of Infinite-Domain Constraint Satisfaction
Constraint Satisfaction with Countable Homogeneous Templates
A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
PAIRWISE NONISOMORPHIC MAXIMAL-CLOSED SUBGROUPS OF SYM(ℕ) VIA THE CLASSIFICATION OF THE REDUCTS OF THE HENSON DIGRAPHS
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
Completing orientations of partially oriented graphs
A Dichotomy for First-Order Reducts of Unary Structures
On the computational complexity of ordered subgraph recognition
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures
PROJECTIVE CLONE HOMOMORPHISMS
CORES OVER RAMSEY STRUCTURES
Ontology-Based Data Access
A Proof of the CSP Dichotomy Conjecture
Classifying the Complexity of Constraints Using Finite Algebras
Nombre chromatique et plus longs chemins d'un graphe
Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
Zur algebraischen Begründung der Graphentheorie. I
The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

This page was built for publication: Forbidden tournaments and the orientation completion problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6668354)