On the public citation graph

Cyclically k-partite digraphs and k-kernels

0 signed · 42 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.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/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(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/0012-365x(92)90713-popenalex-snapshot
On the existence of kernels and h-kernels in directed graphs
inferredcites →https://doi.org/10.1016/j.dam.2012.10.008openalex-snapshot
A note on the upper bound and girth pair of (k;g) -cages
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.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.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/s0012-365x(96)00064-7openalex-snapshot
On (k, l)-kernels in generalized products
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.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.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.11575/cdm.v7i2.62146.g46744openalex-snapshot
Tournaments with kernels by monochromatic paths
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.1214/ejp.v14-637openalex-snapshot
On the asymptotic behaviour of increasing self-similar Markov processes
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.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.1449openalex-snapshot
Directed hypergraphs: A tool for researching digraphs and hypergraphs
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.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

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/s00454-011-9379-zopenalex-snapshot
A Generalisation of Tverberg’s Theorem
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.disc.2012.05.005openalex-snapshot
k -kernels in k -transitive and k -quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116247openalex-snapshot
Kernels by paths with a generalized concatenation
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.7151/dmgt.1727openalex-snapshot
On the complexity of the 3-kernel problem in some classes of 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.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.