On the public citation graph

The gallai-younger conjecture for planar graphs

0 signed · 16 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/bf02579195openalex-snapshot
Disjoint cycles in digraphs
inferredcites →https://doi.org/10.1016/0012-365x(87)90122-1openalex-snapshot
A note on short cycles in diagraphs
inferredcites →https://doi.org/10.1090/conm/147/01176openalex-snapshot
Intercyclic 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/978-3-540-73420-8_33openalex-snapshot
Parameterized Approximability of the Disjoint Cycle Problem
inferred← citeshttps://doi.org/10.1007/s00493-020-4423-3openalex-snapshot
Packing and Covering Balls in Graphs Excluding a Minor
inferred← citeshttps://doi.org/10.1007/s10878-011-9440-0openalex-snapshot
Approximate min-max relations on plane graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.025openalex-snapshot
Recent techniques and results on the Erdős–Pósa property
inferred← citeshttps://doi.org/10.1137/1.9781611973105.27openalex-snapshot
Packing directed cycles through a specified vertex set
inferred← citeshttps://doi.org/10.1137/100786423openalex-snapshot
Packing Directed Circuits through Prescribed Vertices Bounded Fractionally
inferred← citeshttps://doi.org/10.1137/16m1092726openalex-snapshot
Coloring Jordan Regions and Curves
inferred← citeshttps://doi.org/10.1137/17m1150694openalex-snapshot
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs
inferred← citeshttps://doi.org/10.1137/23m157020xopenalex-snapshot
Packing Cycles in Planar and Bounded-Genus Graphs
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-5openalex-snapshot
Hitting minors, subdivisions, and immersions in tournaments
inferred← citeshttps://doi.org/10.46298/dmtcs.7474openalex-snapshot
On the inversion number of oriented graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1703.02866openalex-snapshot
The Half-integral Erdös-Pósa Property for Non-null Cycles
inferred← citeshttps://doi.org/10.70675/658f0687ze25fz44e7z9761z187dd29af957openalex-snapshot
Structural and algorithmic aspects of partial orderings of graphs
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.