On the public citation graph

Minimum dominating cycles in 2-trees

https://doi.org/10.1007/bf00995176
0 signed · 28 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/net.3230070305openalex-snapshot
Towards a theory of domination in graphs
inferredcites →https://doi.org/10.1016/0020-0190(75)90011-3openalex-snapshot
A linear algorithm for the domination number of a tree
inferredcites →https://doi.org/10.1145/321958.321964openalex-snapshot
R -Domination in Graphs
inferredcites →https://doi.org/10.4153/cmb-1977-034-8openalex-snapshot
On Spanning and Dominating Circuits in 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/jgt.3190040108openalex-snapshot
Centers of maximal outerplanar graphs
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_26openalex-snapshot
Algorithmic Aspects of Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_28openalex-snapshot
Algorithmic Aspects of Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_8openalex-snapshot
Approximate Realizations for Outerplanaric Degree Sequences
inferred← citeshttps://doi.org/10.1007/bf00977745openalex-snapshot
Minimum dominating cycles in outerplanar graphs
inferred← citeshttps://doi.org/10.1007/pl00001292openalex-snapshot
Short Dominating Paths and Cycles in the Binary Hypercube
inferred← citeshttps://doi.org/10.1007/s10589-025-00726-4openalex-snapshot
Formulations and algorithms for the simple cycle problem
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90362-lopenalex-snapshot
Dominating cycles in halin graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90365-oopenalex-snapshot
Bibliography on domination in graphs and some basic definitions of domination parameters
inferred← citeshttps://doi.org/10.1016/0166-218x(80)90039-6openalex-snapshot
Computation of the center and diameter of outerplanar graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90201-kopenalex-snapshot
An optimal algorithm for finding dominating cycles in circular-arc graphs
inferred← citeshttps://doi.org/10.1016/0167-6377(85)90044-6openalex-snapshot
Finding minimum dominating cycles in permutation graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.121openalex-snapshot
Formulating and Solving the Minimum Dominating Cycle Problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103588openalex-snapshot
Approximate realizations for outerplanaric degree sequences
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00187-0openalex-snapshot
H-domination in graphs
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80045-6openalex-snapshot
Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70024-4openalex-snapshot
Centers of 2–Trees
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)71051-3openalex-snapshot
Dominating Cycles in Halin Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)71054-9openalex-snapshot
Bibliography on Domination in Graphs and Some Basic Definitions of Domination Parameters
inferred← citeshttps://doi.org/10.1017/s0004972700027118openalex-snapshot
Existence theorems for floorplans
inferred← citeshttps://doi.org/10.1137/0210028openalex-snapshot
Recursive Graphs, Recursive Labelings and Shortest Paths
inferred← citeshttps://doi.org/10.1142/s1793830919500083openalex-snapshot
Symmetry breaking in planar and maximal outerplanar graphs
inferred← citeshttps://doi.org/10.1587/transinf.2017fcp0007openalex-snapshot
Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes
inferred← citeshttps://doi.org/10.20429/tag.2024.000105openalex-snapshot
A Survey of Maximal k-Degenerate Graphs and 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.