On the public citation graph

Kernels by monochromatic paths and the color-class digraph

0 signed · 47 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.1016/0012-365x(95)00036-vopenalex-snapshot
On monochromatic paths and monochromatic cycles in edge coloured tournaments
inferredcites →https://doi.org/10.1016/0095-8956(82)90047-8openalex-snapshot
On monochromatic paths in edge-coloured digraphs
inferredcites →https://doi.org/10.1016/j.disc.2003.10.024openalex-snapshot
Absorbing sets in arc-coloured tournaments
inferredcites →https://doi.org/10.1016/j.disc.2003.11.015openalex-snapshot
A counterexample to a conjecture on edge-coloured tournaments
inferredcites →https://doi.org/10.1016/j.disc.2004.03.005openalex-snapshot
On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
inferredcites →https://doi.org/10.1016/j.disc.2005.12.031openalex-snapshot
Perfect graphs, kernels, and cores of cooperative games
inferredcites →https://doi.org/10.1016/j.disc.2012.04.018openalex-snapshot
A new characterization of perfect graphs
inferredcites →https://doi.org/10.1109/lics.2002.1029831openalex-snapshot
The 0-1 law fails for frame satisfiability of propositional modal logic
inferredcites →https://doi.org/10.1201/9781315141428openalex-snapshot
Domination in graphs : advanced topics
inferredcites →https://doi.org/10.1201/9781482246582openalex-snapshot
Fundamentals of Domination in Graphs
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.2478/s11533-008-0044-6openalex-snapshot
On kernels by monochromatic paths in the corona of digraphs
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.7151/dmgt.1406openalex-snapshot
Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments
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.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.1002/jgt.22389openalex-snapshot
A dichotomy for the kernel by H‐walks problem in digraphs
inferred← citeshttps://doi.org/10.1007/s00373-012-1150-6openalex-snapshot
H-Kernels in Infinite Digraphs
inferred← citeshttps://doi.org/10.1007/s00373-013-1367-zopenalex-snapshot
On Panchromatic Digraphs and the Panchromatic Number
inferred← citeshttps://doi.org/10.1007/s00373-014-1412-6openalex-snapshot
An Extension of Richardson’s Theorem in m-Colored Digraphs
inferred← citeshttps://doi.org/10.1007/s00373-015-1609-3openalex-snapshot
Richardson’s Theorem in H-coloured Digraphs
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.akcej.2016.06.005openalex-snapshot
-kernels by walks in -colored digraphs and the color-class digraph
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.03.002openalex-snapshot
(, )-kernels and Sands, Sauer and Woodrow’s theorem
inferred← citeshttps://doi.org/10.1016/j.amc.2022.127089openalex-snapshot
H -kernels in H -colored digraphs without (ξ1,ξ,ξ2) - H -subdivisions of C3→
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.008openalex-snapshot
A note on the upper bound and girth pair of (k;g) -cages
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.2021.08.004openalex-snapshot
Restricted domination in Quasi-transitive and 3-Quasi-transitive digraphs
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.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.2015.05.021openalex-snapshot
H -kernels and H -obstructions in H -colored digraphs
inferred← citeshttps://doi.org/10.1080/09728600.2011.12088942openalex-snapshot
K-Kernels in Multipartite Tournaments
inferred← citeshttps://doi.org/10.11575/cdm.v7i2.62146.g46744openalex-snapshot
Tournaments with kernels by monochromatic paths
inferred← citeshttps://doi.org/10.48550/arxiv.2105.00044openalex-snapshot
On $(k,l,H)$-kernels by walks and the H-class digraph
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.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.1860openalex-snapshot
Kernels by monochromatic paths and color-perfect digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.2199openalex-snapshot
H-kernels in unions of H-colored quasi-transitive digraphs
inferred← citeshttps://doi.org/10.7862/rf.2012.9openalex-snapshot
On parameters of independence, domination and irredundance in edge-coloured graphs and their products
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.