On the public citation graph

An Asymptotic Result for the Path Partition Conjecture

https://doi.org/10.37236/1945
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/bf02280296openalex-snapshot
On decomposition of graphs
inferredcites →https://doi.org/10.1016/j.disc.2004.07.012openalex-snapshot
Path partitions and Pn -free sets
inferredcites →https://doi.org/10.1016/j.disc.2005.11.065openalex-snapshot
The Path Partition Conjecture is true for claw-free graphs
inferredcites →https://doi.org/10.1016/s1571-0653(04)00066-6openalex-snapshot
Path Partitions and Pn-free Sets
inferredcites →https://doi.org/10.7151/dmgt.1037openalex-snapshot
A survey of hereditary properties of graphs
inferredcites →https://doi.org/10.7151/dmgt.1058openalex-snapshot
Partition problems and kernels of graphs
inferredcites →https://doi.org/10.7151/dmgt.1068openalex-snapshot
A path(ological) partition problem
inferredcites →https://doi.org/10.7151/dmgt.1150openalex-snapshot
Detour Chromatic Numbers

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4474198openalex-extracted
The Path Partition Conjecture Holds for a = 9
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_10openalex-snapshot
The Path Partition Conjecture
inferred← citeshttps://doi.org/10.1016/j.aml.2011.02.003openalex-snapshot
A note on a cycle partition problem
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.002openalex-snapshot
On a cycle partition problem
inferred← citeshttps://doi.org/10.1016/j.disc.2008.05.002openalex-snapshot
A note on the Path Kernel Conjecture
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.046openalex-snapshot
On a tree-partition problem
inferred← citeshttps://doi.org/10.37236/874openalex-snapshot
A Traceability Conjecture for Oriented Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2468openalex-snapshot
On the Strong Path Partition Conjecture
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.