On the public citation graph

On the complexity of the 3-kernel problem in some classes of digraphs

0 signed · 26 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.3190200205openalex-snapshot
Quasi‐transitive digraphs
inferredcites →https://doi.org/10.1016/0012-365x(87)90064-1openalex-snapshot
A counterexample to a generalization of Richardson's theorem
inferredcites →https://doi.org/10.1016/0012-365x(90)90346-jopenalex-snapshot
Recent problems and results about kernels in directed graphs
inferredcites →https://doi.org/10.1016/0166-218x(81)90003-2openalex-snapshot
Planar kernel and grundy with d≤3, dout≤2, din≤2 are NP-complete
inferredcites →https://doi.org/10.1016/j.disc.2010.06.008openalex-snapshot
On the structure of strong 3-quasi-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.1016/j.disc.2013.08.007openalex-snapshot
On the existence and number of (k+1) -kings in k -quasi-transitive digraphs
inferredcites →https://doi.org/10.1080/09728600.2011.12088942openalex-snapshot
K-Kernels in Multipartite Tournaments
inferredcites →https://doi.org/10.1090/s0002-9904-1946-08518-3openalex-snapshot
On weakly ordered systems
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

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.22389openalex-snapshot
A dichotomy for the kernel by H‐walks problem in digraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-58892-2_13openalex-snapshot
Domination in Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_8openalex-snapshot
Quasi-Transitive Digraphs and Their Extensions
inferred← citeshttps://doi.org/10.1007/s40590-022-00484-xopenalex-snapshot
(H, k)-reachability in H-arc-colored digraphs
inferred← citeshttps://doi.org/10.1007/s40590-025-00711-1openalex-snapshot
The theorem of Richardson and its generalizations: a survey
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.048openalex-snapshot
A new generalization of kernels in digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.014openalex-snapshot
Critical Kernel Imperfectness in 4-quasi-transitive digraphs and 4-anti-transitive digraphs of small diameter
inferred← citeshttps://doi.org/10.1016/j.disc.2017.10.006openalex-snapshot
On the existence of 3 - and 4 -kernels in digraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.031openalex-snapshot
On the complexity of the k-kernel problem on cyclically k-partite digraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116247openalex-snapshot
Kernels by paths with a generalized concatenation
inferred← citeshttps://doi.org/10.48550/arxiv.1605.09589openalex-snapshot
A dichotomy for the kernel by $H$-walks problem in digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1610.05730openalex-snapshot
On the existence of $3$- and $4$-kernels in digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2006.05607openalex-snapshot
Kings and Kernels in Semicomplete Compositions
inferred← citeshttps://doi.org/10.7151/dmgt.1747openalex-snapshot
On the existence of (k,l)-kernels in infinite digraphs: A survey
inferred← citeshttps://doi.org/10.7151/dmgt.1922openalex-snapshot
Some results on 4-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.