On the public citation graph
Some results on 4-transitive digraphs
0 signed · 23 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.1007/978-1-4471-3886-0openalex-snapshot
Digraphs Theory Algorithms And Applications
inferredcites →https://doi.org/10.1016/j.disc.2007.05.016openalex-snapshot
Independent sets and non-augmentable paths in generalizations of tournaments
inferredcites →https://doi.org/10.1016/j.disc.2010.11.009openalex-snapshot
Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs
inferredcites →https://doi.org/10.1016/j.disc.2012.05.005openalex-snapshot
k -kernels in k -transitive and k -quasi-transitive digraphs
inferredcites →https://doi.org/10.7151/dmgt.1458openalex-snapshot
Independent transversals of longest paths in locally semicomplete and transitive digraphs
inferredcites →https://doi.org/10.7151/dmgt.1530openalex-snapshot
Cyclically k-partite digraphs and k-kernels
inferredcites →https://doi.org/10.7151/dmgt.1546openalex-snapshot
k-kernels in generalizations of transitive digraphs
inferredcites →https://doi.org/10.7151/dmgt.1645openalex-snapshot
4-transitive digraphs I: the structure of strong 4-transitive digraphs
inferredcites →https://doi.org/10.7151/dmgt.1727openalex-snapshot
On the complexity of the 3-kernel problem in some classes of digraphs
inferredcites →https://doi.org/10.7151/dmgt.1747openalex-snapshot
On the existence of (k,l)-kernels in infinite digraphs: A survey
inferredcites →https://doi.org/10.7151/dmgt.1765openalex-snapshot
On the structure of strong k-transitive digraphs
inferredcites →https://doi.org/10.7151/dmgt.1787openalex-snapshot
(k-1)-kernels in strong k-transitive digraphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4494891openalex-extracted
Strong $K$-Transitive Oriented Graphs with Large Minimum Degree
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_8openalex-snapshot
Quasi-Transitive Digraphs and Their Extensions
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.011openalex-snapshot
Seymour’s second neighborhood conjecture for 5-anti-transitive oriented graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.12.026openalex-snapshot
Seymour’s Second Neighborhood Conjecture for 6-antitransitive digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.011openalex-snapshot
Seymour’s second neighborhood conjecture for m -free, k -transitive, k -anti-transitive digraphs and some approaches
inferred← citeshttps://doi.org/10.1016/j.dam.2023.05.012openalex-snapshot
A note on Seymour’s second neighborhood conjecture
inferred← citeshttps://doi.org/10.1016/j.dam.2026.04.014openalex-snapshot
A note on the second neighborhood problem for k-anti-transitive digraphs with large girth
inferred← citeshttps://doi.org/10.1155/2022/1463016openalex-snapshot
Seymour’s Second Neighborhood Conjecture for m-Free Oriented Graphs
inferred← citeshttps://doi.org/10.47749/t/unicamp.2022.1247954openalex-snapshot
Path partition poblems in digraphs
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.