On the public citation graph

Reachability problems in edge-colored digraphs

0 signed · 41 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-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/bf02476378openalex-snapshot
On dominance relations and the structure of animal societies: III The condition for a score structure
inferredcites →https://doi.org/10.1007/bfb0066192openalex-snapshot
Every directed graph has a semi-kernel
inferredcites →https://doi.org/10.1007/bfb0073101openalex-snapshot
Monochromatic reachability, complementary cycles, and single arc reversals in tournaments
inferredcites →https://doi.org/10.1007/pl00007227openalex-snapshot
Rooted Spanning Trees in Tournaments
inferredcites →https://doi.org/10.1016/0012-365x(86)90168-8openalex-snapshot
On Ramsey-Turán type problems in tournaments
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/0095-8956(88)90059-7openalex-snapshot
On monochromatic paths in m-coloured tournaments
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.2307/3008805openalex-snapshot
Graph Theory with Applications

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-1395-8openalex-snapshot
H-Paths and H-Cycles in H-Coloured 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/s00373-019-02066-7openalex-snapshot
Some Conditions for the Existence of Euler H-trails
inferred← citeshttps://doi.org/10.1007/s00373-022-02469-zopenalex-snapshot
H-Kernels by Walks
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.1007/s40590-026-00917-xopenalex-snapshot
Kernels in digraphs with colored vertices
inferred← citeshttps://doi.org/10.1016/j.akcej.2015.11.005openalex-snapshot
Independent and monochromatic absorbent sets in infinite digraphs
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.02.009openalex-snapshot
H-kernels by walks in an () digraph
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.05.005openalex-snapshot
-panchromatic 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.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.2019.04.020openalex-snapshot
Characterization of color patterns by dynamic H -paths
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.dam.2026.05.006openalex-snapshot
Restricted reachability in infinite digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.04.003openalex-snapshot
Monochromatic sinks in nearly transitive arc-colored tournaments
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.1016/j.disc.2016.03.014openalex-snapshot
On panchromatic patterns
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.029openalex-snapshot
A generalization of properly colored paths and cycles in edge-colored graphs
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.2105.00044openalex-snapshot
On $(k,l,H)$-kernels by walks and the H-class digraph
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.7151/dmgt.2459openalex-snapshot
Panchromatic patterns by paths
inferred← citeshttps://doi.org/10.7151/dmgt.2463openalex-snapshot
$(k,H)$-kernels in nearly tournaments
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.