On the public citation graph

Monochromatic reachability, complementary cycles, and single arc reversals in tournaments

0 signed · 18 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/bf01886384openalex-snapshot
Bemerkungen zum graphentheoretischen Satze von I. Fidrich
inferredcites →https://doi.org/10.1016/0012-365x(89)90295-1openalex-snapshot
Selected topics in graph theory 3
inferredcites →https://doi.org/10.1016/0095-8956(80)90061-1openalex-snapshot
Hamiltonian-connected 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/s0304-0208(08)73025-1openalex-snapshot
Two Complementary Circuits in Two-Connected Tournaments
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.186openalex-snapshot
THE THEORY OF GRAPHS AND ITS APPLICATIONS
inferredcites →https://doi.org/10.2307/1911908openalex-snapshot
The Theory of Graphs and Its 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.20063openalex-snapshot
Arc reversal in nonhamiltonian circulant oriented graphs
inferred← citeshttps://doi.org/10.1007/s10288-007-0036-6openalex-snapshot
A survey on the linear ordering problem for weighted or unweighted tournaments
inferred← citeshttps://doi.org/10.1007/s10479-009-0648-7openalex-snapshot
An updated survey on the linear ordering problem for weighted or unweighted tournaments
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90068-2openalex-snapshot
Counterexamples to Adám's conjecture on arc reversals in directed graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90059-7openalex-snapshot
On monochromatic paths in m-coloured tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.042openalex-snapshot
Reachability problems in edge-colored 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.2010.12.009openalex-snapshot
On arc reversal in balanced digraphs
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16414.xopenalex-snapshot
Score Vectors of Tournaments
inferred← citeshttps://doi.org/10.1201/b16132-17openalex-snapshot
Tournaments
inferred← citeshttps://doi.org/10.47443/cm.2022.014openalex-snapshot
On Arc Reversal in Digraphs With a Restricted Number of Cycles
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.