On the public citation graph

Minimum-weight pairs of completely independent spanning trees in complete graphs

https://doi.org/10.2139/ssrn.7583657
0 signed · 10 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.1002/jgt.21780openalex-snapshot
Dirac's Condition for Completely Independent Spanning Trees
inferredcites →https://doi.org/10.1002/net.20460openalex-snapshot
Completely independent spanning trees in torus networks
inferredcites →https://doi.org/10.1016/j.dam.2014.06.002openalex-snapshot
Ore’s condition for completely independent spanning trees
inferredcites →https://doi.org/10.1016/j.dam.2023.07.001openalex-snapshot
Two completely independent spanning trees of split graphs
inferredcites →https://doi.org/10.1016/j.disc.2011.11.015openalex-snapshot
Two counterexamples on completely independent spanning trees
inferredcites →https://doi.org/10.1016/s0012-365x(00)00377-0openalex-snapshot
Completely independent spanning trees in the underlying graph of a line digraph
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.221openalex-snapshot
On the Problem of Decomposing a Graph into n Connected Factors
inferredcites →https://doi.org/10.1145/3591110openalex-snapshot
Independent Spanning Trees in Networks: A Survey
inferredcites →https://doi.org/10.1287/moor.10.4.701openalex-snapshot
A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
inferredcites →https://doi.org/10.7151/dmgt.1806openalex-snapshot
Completely independent spanning trees in (partial) k-trees
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.