On the public citation graph

On (k,l)-kernels in D-join of digraphs

0 signed · 13 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.1016/0012-365x(92)90713-popenalex-snapshot
On the existence of kernels and h-kernels in directed graphs
inferredcites →https://doi.org/10.1016/s0012-365x(96)00064-7openalex-snapshot
On (k, l)-kernels in generalized products
inferredcites →https://doi.org/10.1016/s0012-365x(99)00026-6openalex-snapshot
Some operations preserving the existence of kernels
inferredcites →https://doi.org/10.7151/dmgt.1265openalex-snapshot
On (k,l)-perfectnees of Special Classes of Digraphs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_10openalex-snapshot
Digraphs Products
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.1080/09728600.2011.12088942openalex-snapshot
K-Kernels in Multipartite Tournaments
inferred← citeshttps://doi.org/10.17951/a.2016.70.2.1openalex-snapshot
On (2-d)-kernels in the cartesian product of graphs
inferred← citeshttps://doi.org/10.25124/demandia.v6i1.3424openalex-snapshot
ANALISIS NATIVE ADVERTISING SEBAGAI KONTEN MEDIA ONLINE DREAMERS.ID
inferred← citeshttps://doi.org/10.7151/dmgt.1530openalex-snapshot
Cyclically k-partite digraphs and k-kernels
inferred← citeshttps://doi.org/10.7151/dmgt.1546openalex-snapshot
k-kernels in generalizations of transitive digraphs
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.2104openalex-snapshot
About (k,l)-kernels, semikernels and Grundy functions in partial line 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.