On the public citation graph
Minimum Connected Dominating Sets of Random Cubic Graphs
0 signed · 21 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.3190130604openalex-snapshot
Spanning trees with many leaves in cubic graphs
inferredcites →https://doi.org/10.1006/jagm.1998.0944openalex-snapshot
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
inferredcites →https://doi.org/10.1007/3-540-68530-8_37openalex-snapshot
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
inferredcites →https://doi.org/10.1016/0020-0190(81)90141-1openalex-snapshot
Constructing full spanning trees for cubic graphs
inferredcites →https://doi.org/10.1016/0020-0190(94)90139-2openalex-snapshot
A short note on the approximability of the maximum leaves spanning tree problem
inferredcites →https://doi.org/10.1017/cbo9780511721335.010openalex-snapshot
Models of Random Regular Graphs
inferredcites →https://doi.org/10.1214/aoap/1177004612openalex-snapshot
Differential Equations for Random Processes and Random Graphs
inferredcites →https://doi.org/10.37236/449openalex-snapshot
Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20347openalex-snapshot
Nonrepetitive list colourings of paths
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_24openalex-snapshot
On the Connected Domination Number of Random Regular Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.026openalex-snapshot
Fractional Thue chromatic number of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.04.010openalex-snapshot
Full degree spanning trees in random regular graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.06.017openalex-snapshot
Nonrepetitive colorings of trees
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.063openalex-snapshot
Breaking the rhythm on graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.039openalex-snapshot
Thue type problems for graphs, points, and numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2008.05.029openalex-snapshot
Connected domination of regular graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.077openalex-snapshot
Nonrepetitive colorings of graphs
inferred← citeshttps://doi.org/10.1080/07408170500247352openalex-snapshot
Very high density storage systems
inferred← citeshttps://doi.org/10.1109/wicom.2008.584openalex-snapshot
Multicasting Approach in Mobile Ad-Hoc Networks and its Performance Analysis
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2138243/v1openalex-snapshot
Minimum Dominating Sets in Uncertain Graphs
inferred← citeshttps://doi.org/10.37236/449openalex-snapshot
Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic 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.