On the public citation graph
$P_{6}$-Isolation in Graphs Under Maximum Degree Constraints
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.
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.1007/978-3-030-51117-3openalex-snapshot
Topics in Domination in Graphs
inferredcites →https://doi.org/10.1007/s40840-024-01711-6openalex-snapshot
Extremal Graphs for the $$K_{1,2}$$-Isolation Number of Graphs
inferredcites →https://doi.org/10.1016/j.disc.2025.114970openalex-snapshot
Solution to a 3-path isolation problem for subcubic graphs
inferredcites →https://doi.org/10.1016/j.ipl.2024.106521openalex-snapshot
Algorithmic aspects of {P}-isolation in graphs and extremal graphs for a {P3}-isolation bound
inferredcites →https://doi.org/10.1201/9781482246582openalex-snapshot
Fundamentals of Domination in Graphs
inferredcites →https://doi.org/10.2139/ssrn.4589640openalex-snapshot
New Results on the 1-Isolation Number of Graphs Without Short Cycles
inferredcites →https://doi.org/10.2298/fil1712925copenalex-snapshot
Partial domination - the isolation number of a graph
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.