On the public citation graph
Kernels in quasi-transitive digraphs
0 signed · 34 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.3190060307openalex-snapshot
A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular‐arc graphs, and nested interval graphs
inferredcites →https://doi.org/10.1002/jgt.3190110112openalex-snapshot
A sufficient condition for a digraph to be kernel‐perfect
inferredcites →https://doi.org/10.1016/0012-365x(81)90264-8openalex-snapshot
A note on kernel-critical graphs
inferredcites →https://doi.org/10.1016/0012-365x(84)90131-6openalex-snapshot
On kernels and semikernels of digraphs
inferredcites →https://doi.org/10.1016/0012-365x(95)00096-fopenalex-snapshot
Perfect graphs are kernel solvable
inferredcites →https://doi.org/10.1016/0095-8956(82)90047-8openalex-snapshot
On monochromatic paths in edge-coloured digraphs
inferredcites →https://doi.org/10.1016/s0012-365x(97)00179-9openalex-snapshot
Kings in quasi-transitive digraphs
inferredcites →https://doi.org/10.1073/pnas.39.7.649openalex-snapshot
Extension Theorems for Solutions of Irreflexive Relations
inferredcites →https://doi.org/10.1090/mbk/121/32openalex-snapshot
Theory of games and economic behavior
inferredcites →https://doi.org/10.1137/s0895480199354220openalex-snapshot
Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
inferredcites →https://doi.org/10.2307/2280142openalex-snapshot
Theory of Games and Economic Behavior.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00373-019-02022-5openalex-snapshot
Critical Kernel Imperfect Problem in Generalizations of Bipartite Tournaments
inferred← citeshttps://doi.org/10.1007/s00373-020-02179-4openalex-snapshot
Richardson’s theorem in quasi-transitive and pre-transitive digraphs
inferred← citeshttps://doi.org/10.1007/s10998-006-0025-0openalex-snapshot
Two geometric representation theorems for separoids
inferred← citeshttps://doi.org/10.1007/s40590-022-00484-xopenalex-snapshot
(H, k)-reachability in H-arc-colored digraphs
inferred← citeshttps://doi.org/10.1016/j.akcej.2017.02.005openalex-snapshot
Infinite kernel perfect digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.11.005openalex-snapshot
Kernels by monochromatic paths in m -colored unions of quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.02.028openalex-snapshot
Infinite quasi-transitive digraphs with domination number 2
inferred← citeshttps://doi.org/10.1016/j.dam.2018.06.033openalex-snapshot
Unions of digraphs which become kernel perfect
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.004openalex-snapshot
Restricted domination in Quasi-transitive and 3-Quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.05.005openalex-snapshot
k -kernels in k -transitive and k -quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112362openalex-snapshot
Chordality of locally semicomplete and weakly quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.11.011openalex-snapshot
Erdős–Szekeres “happy end”-type theorems for separoïds
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116247openalex-snapshot
Kernels by paths with a generalized concatenation
inferred← citeshttps://doi.org/10.1155/2007/906973openalex-snapshot
Bloch‐type space of temperature functions on a finite cylinder
inferred← citeshttps://doi.org/10.7151/dmgt.1512openalex-snapshot
Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1546openalex-snapshot
k-kernels in generalizations of transitive digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.2199openalex-snapshot
H-kernels in unions of H-colored quasi-transitive digraphs
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.