On the public citation graph
In-Tournament Digraphs
0 signed · 46 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1097-0118(200102)36:2<84::aid-jgt4>3.0.co;2-dopenalex-snapshot
Vertex pancyclic in-tournaments
inferred← citeshttps://doi.org/10.1002/jgt.20348openalex-snapshot
Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in‐tournaments
inferred← citeshttps://doi.org/10.1002/jgt.20408openalex-snapshot
Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments
inferred← citeshttps://doi.org/10.1002/jgt.22067openalex-snapshot
Partial Characterizations of 1‐Perfectly Orientable Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22157openalex-snapshot
Completing orientations of partially oriented graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190200214openalex-snapshot
Digraphs with the path‐merging property
inferred← citeshttps://doi.org/10.1006/jagm.2001.1174openalex-snapshot
The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs
inferred← citeshttps://doi.org/10.1006/jctb.1998.1829openalex-snapshot
Cycles through Large Degree Vertices in Digraphs: A Generalization of Meyniel's Theorem
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_10openalex-snapshot
Avoidable Vertices and Edges in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_8openalex-snapshot
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_1openalex-snapshot
Basic Terminology, Notation and Results
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_6openalex-snapshot
Locally Semicomplete Digraphs and Generalizations
inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_35openalex-snapshot
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
inferred← citeshttps://doi.org/10.1007/s00373-026-03022-yopenalex-snapshot
Cycles of Lengths 3 and $$n-1$$ in Digraphs Under a Bang-Jensen–Gutin–Li Type Condition
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00091-5openalex-snapshot
On powers of circular arc graphs and proper circular arc graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2024.128912openalex-snapshot
Orientations without forbidden patterns on three vertices
inferred← citeshttps://doi.org/10.1016/j.dam.2017.09.017openalex-snapshot
1 -perfectly orientable K4 -minor-free and outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.006openalex-snapshot
Avoidable vertices and edges in graphs: Existence, characterization, and applications
inferred← citeshttps://doi.org/10.1016/j.disc.2004.03.010openalex-snapshot
Vertex 6-pancyclic in-tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.031openalex-snapshot
Perfect graphs, kernels, and cores of cooperative games
inferred← citeshttps://doi.org/10.1016/j.disc.2006.12.008openalex-snapshot
All 2-connected in-tournaments that are cycle complementary
inferred← citeshttps://doi.org/10.1016/j.disc.2007.05.016openalex-snapshot
Independent sets and non-augmentable paths in generalizations of tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.042openalex-snapshot
On arc-traceable local tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2011.05.032openalex-snapshot
Cycles in k -traceable oriented graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.10.014openalex-snapshot
The Path Partition Conjecture is true for some generalizations of tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2016.09.023openalex-snapshot
1 -perfectly orientable graphs and graph products
inferred← citeshttps://doi.org/10.1016/j.endm.2016.09.035openalex-snapshot
1-perfectly orientable K 4 -minor-free and outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.03.005openalex-snapshot
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00419-8openalex-snapshot
Cycles in multipartite tournaments: results and problems
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00578-2openalex-snapshot
Restricted circular-arc graphs and clique cycles
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00089-1openalex-snapshot
A characterization of normal fraternally orientable perfect graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00293-1openalex-snapshot
Pancyclic orderings of in-tournaments
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80053-8openalex-snapshot
Pancyclic orderings of in-tournaments
inferred← citeshttps://doi.org/10.1080/02331930701780003openalex-snapshot
A sufficient condition for a digraph to be positive-round
inferred← citeshttps://doi.org/10.1137/20m1352119openalex-snapshot
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
inferred← citeshttps://doi.org/10.1137/23m1604849openalex-snapshot
Forbidden Tournaments and the Orientation Completion Problem
inferred← citeshttps://doi.org/10.1137/25m1726157openalex-snapshot
An Algebraic Proof of the Dichotomy for Graph Orientation Problems with Forbidden Tournaments
inferred← citeshttps://doi.org/10.37236/2497openalex-snapshot
Recognition and Characterization of Chronological Interval Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1511.07314openalex-snapshot
1-perfectly orientable graphs and graph products
inferred← citeshttps://doi.org/10.48550/arxiv.1907.12078openalex-snapshot
Avoidable Vertices and Edges in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702097openalex-snapshot
Avoiding bias in cards cryptography
inferred← citeshttps://doi.org/10.7151/dmgt.1223openalex-snapshot
Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel
inferred← citeshttps://doi.org/10.7151/dmgt.2463openalex-snapshot
$(k,H)$-kernels in nearly tournaments
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.