On the public citation graph

On the existence of (k,l)-kernels in infinite digraphs: A survey

0 signed · 63 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.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4471-3886-0openalex-snapshot
Digraphs Theory Algorithms And Applications
inferredcites →https://doi.org/10.1007/bf02099507openalex-snapshot
Geometry of quantum principal bundles I
inferredcites →https://doi.org/10.1007/bfb0066192openalex-snapshot
Every directed graph has a semi-kernel
inferredcites →https://doi.org/10.1007/s00032-011-0147-6openalex-snapshot
Self-focusing Multibump Standing Waves in Expanding Waveguides
inferredcites →https://doi.org/10.1007/s00446-010-0108-2openalex-snapshot
New combinatorial topology bounds for renaming: the lower bound
inferredcites →https://doi.org/10.1016/0012-365x(93)90496-gopenalex-snapshot
Kernels in directed graphs: a poison game
inferredcites →https://doi.org/10.1016/j.disc.2007.08.078openalex-snapshot
On the existence and on the number of (k,l) -kernels in the lexicographic product of graphs
inferredcites →https://doi.org/10.1016/j.disc.2008.01.025openalex-snapshot
Some sufficient conditions for the existence of kernels in infinite digraphs
inferredcites →https://doi.org/10.1016/j.disc.2008.08.006openalex-snapshot
Quasi-kernels and quasi-sinks in infinite graphs
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.2010.09.022openalex-snapshot
Kernels by monochromatic paths in digraphs with covering number 2
inferredcites →https://doi.org/10.1016/j.disc.2012.04.018openalex-snapshot
A new characterization of perfect graphs
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.1016/j.endm.2009.07.010openalex-snapshot
A classification of arc-locally semicomplete digraphs
inferredcites →https://doi.org/10.1016/j.matpur.2011.06.005openalex-snapshot
The Kalman condition for the boundary controllability of coupled parabolic systems. Bounds on biorthogonal families to complex matrix exponentials
inferredcites →https://doi.org/10.1016/s0167-5060(08)70041-4openalex-snapshot
Graphes Noyau-Parfaits
inferredcites →https://doi.org/10.1080/03605302.2013.771657openalex-snapshot
Alternating Sign Multibump Solutions of Nonlinear Elliptic Equations in Expanding Tubular Domains
inferredcites →https://doi.org/10.1080/09728600.2010.12088916openalex-snapshot
Kernels in infinite digraphs
inferredcites →https://doi.org/10.1080/09728600.2011.12088942openalex-snapshot
K-Kernels in Multipartite Tournaments
inferredcites →https://doi.org/10.1086/286866openalex-snapshot
Theory of Games and Economic Behavior
inferredcites →https://doi.org/10.1090/mbk/121/32openalex-snapshot
Theory of games and economic behavior
inferredcites →https://doi.org/10.1090/s0002-9904-1946-08518-3openalex-snapshot
On weakly ordered systems
inferredcites →https://doi.org/10.1093/acprof:oso/9780198528173.001.0001openalex-snapshot
Graphs and Homomorphisms
inferredcites →https://doi.org/10.1109/icnc.2010.5582557openalex-snapshot
Applying DNA computing to diagnose-and-interfere hepatic fibrosis
inferredcites →https://doi.org/10.1145/2108242.2108245openalex-snapshot
New combinatorial topology bounds for renaming
inferredcites →https://doi.org/10.1214/09-ps154openalex-snapshot
Proof(s) of the Lamperti representation of continuous-state branching processes
inferredcites →https://doi.org/10.37236/1325openalex-snapshot
Combinatorial Game Theory Foundations Applied to Digraph Kernels
inferredcites →https://doi.org/10.3934/mcrf.2014.4.17openalex-snapshot
Controllability to trajectories for some parabolic systems of three and two equations by one control force
inferredcites →https://doi.org/10.4007/annals.2006.164.51openalex-snapshot
The strong perfect graph theorem
inferredcites →https://doi.org/10.7151/dmgt.1075openalex-snapshot
A sufficient condition for the existence of k-kernels in digraphs
inferredcites →https://doi.org/10.7151/dmgt.1135openalex-snapshot
On (k,l)-kernels of special superdigraphs of P_m and C_m
inferredcites →https://doi.org/10.7151/dmgt.1373openalex-snapshot
On (k,l)-kernels in D-join of digraphs
inferredcites →https://doi.org/10.7151/dmgt.1451openalex-snapshot
Monochromatic paths and monochromatic sets of arcs in bipartite tournaments
inferredcites →https://doi.org/10.7151/dmgt.1512openalex-snapshot
Monochromatic paths and monochromatic sets of arcs in quasi-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.1544openalex-snapshot
Kernels by monochromatic paths and the color-class digraph
inferredcites →https://doi.org/10.7151/dmgt.1545openalex-snapshot
Monochromatic cycles and monochromatic paths in arc-colored digraphs
inferredcites →https://doi.org/10.7151/dmgt.1546openalex-snapshot
k-kernels in generalizations of transitive digraphs
inferredcites →https://doi.org/10.7151/dmgt.1727openalex-snapshot
On the complexity of the 3-kernel problem in some 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/s00373-013-1367-zopenalex-snapshot
On Panchromatic Digraphs and the Panchromatic Number
inferred← citeshttps://doi.org/10.1007/s40590-021-00328-0openalex-snapshot
Fibonacci numbers in graphs with strong (1, 1, 2)-kernels
inferred← citeshttps://doi.org/10.1007/s41468-022-00099-1openalex-snapshot
Steady and ranging sets in graph persistence
inferred← citeshttps://doi.org/10.1016/j.akcej.2017.02.005openalex-snapshot
Infinite kernel perfect digraphs
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.12.020openalex-snapshot
Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels
inferred← citeshttps://doi.org/10.1016/j.dam.2015.09.010openalex-snapshot
Richardson’s Theorem for k -colored kernels in strongly connected digraphs
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.disc.2013.03.008openalex-snapshot
Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
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.1080/09728600.2011.12088942openalex-snapshot
K-Kernels in Multipartite Tournaments
inferred← citeshttps://doi.org/10.14708/cm.v53i1.771openalex-snapshot
Distance Fibonacci numbers, their interpretations and matrix generators
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.3390/sym13020230openalex-snapshot
On (2-d)-Kernels in the Tensor Product of Graphs
inferred← citeshttps://doi.org/10.3390/sym13101948openalex-snapshot
On (2-d)-Kernels in Two Generalizations of the Petersen Graph
inferred← citeshttps://doi.org/10.3390/sym13122399openalex-snapshot
On Independent Secondary Dominating Sets in Generalized Graph Products
inferred← citeshttps://doi.org/10.3390/sym15040802openalex-snapshot
On the Existence of Independent [j,k]-Dominating Sets in the Generalized Corona of Graphs
inferred← citeshttps://doi.org/10.5427/jsing.2014.9nopenalex-snapshot
Strong topological invariance of the monodromy group at infinity for quadratic vector fields
inferred← citeshttps://doi.org/10.5753/etc.2020.11083openalex-snapshot
A new sufficient condition for the existence of 3-kernels
inferred← citeshttps://doi.org/10.7151/dmgt.1922openalex-snapshot
Some results on 4-transitive digraphs
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.