On the public citation graph

New Results on the 1-Isolation Number of Graphs Without Short Cycles

https://doi.org/10.2139/ssrn.4589640
0 signed · 20 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.20345openalex-extracted
Total domination in 2‐connected graphs and in graphs with no induced 6‐cycles
inferredcites →https://doi.org/10.1002/jgt.21855openalex-extracted
Independent Domination in Cubic Graphs
inferredcites →https://doi.org/10.1002/jgt.22968openalex-extracted
A tight bound for independent domination of cubic graphs without 4‐cycles
inferredcites →https://doi.org/10.1002/jgt.3190030306openalex-extracted
Graph‐theoretic parameters concerning domination, independence, and irredundance
inferredcites →https://doi.org/10.1007/978-1-84628-970-5openalex-extracted
Graph Theory
inferredcites →https://doi.org/10.1007/s00026-022-00620-4openalex-extracted
Extensions of the Art Gallery Theorem
inferredcites →https://doi.org/10.1007/s40840-022-01248-6openalex-extracted
Isolation of the Diamond Graph
inferredcites →https://doi.org/10.1016/j.dam.2019.06.011openalex-extracted
Isolation number of maximal outerplanar graphs
inferredcites →https://doi.org/10.1016/j.dam.2020.09.011openalex-extracted
Inequalities between the Kk -isolation number and the independent Kk -isolation number of a graph
inferredcites →https://doi.org/10.1016/j.dam.2021.08.013openalex-extracted
K1,2-isolation in graphs
inferredcites →https://doi.org/10.1016/j.disc.2006.10.011openalex-extracted
The structure of well-covered graphs with no cycles of length 4
inferredcites →https://doi.org/10.1016/j.disc.2007.12.051openalex-extracted
Domination in bipartite graphs
inferredcites →https://doi.org/10.1016/j.disc.2020.111879openalex-extracted
Isolation of k -cliques
inferredcites →https://doi.org/10.48550/arxiv.2112.11720openalex-extracted
Tight bound for independent domination of cubic graphs without $4$-cycles
inferredcites →https://doi.org/10.1007/s00373-020-02143-2openalex-snapshot
Isolation of Cycles
inferredcites →https://doi.org/10.1016/j.dam.2020.01.005openalex-snapshot
Partial domination of maximal outerplanar graphs
inferredcites →https://doi.org/10.2298/fil1712925copenalex-snapshot
Partial domination - the isolation number of a graph

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00373-025-02946-1openalex-snapshot
Isolation of Connected Graphs in Terms of Size
inferred← citeshttps://doi.org/10.1016/j.dam.2025.01.037openalex-snapshot
A characterization of graphs with maximum cycle isolation number
inferred← citeshttps://doi.org/10.2139/ssrn.5400599openalex-snapshot
$P_{6}$-Isolation in Graphs Under Maximum Degree Constraints
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.