On the public citation graph

Minimum dominating cycles in outerplanar graphs

https://doi.org/10.1007/bf00977745
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.
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.1007/bf00995176openalex-snapshot
Minimum dominating cycles in 2-trees
inferredcites →https://doi.org/10.1137/0210062openalex-snapshot
An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar 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/3-540-19487-8_28openalex-snapshot
Independent covers in outerplanar graphs
inferred← citeshttps://doi.org/10.1007/bf01932134openalex-snapshot
In-trees and plane embeddings of outerplanar graphs
inferred← citeshttps://doi.org/10.1007/bf02104831openalex-snapshot
Combinatorial analysis (nonnegative matrices, algorithmic problems)
inferred← citeshttps://doi.org/10.1007/bfb0071635openalex-snapshot
On Halin graphs
inferred← citeshttps://doi.org/10.1007/s003730050048openalex-snapshot
Hamiltonicity of Amalgams
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/0095-8956(85)90081-4openalex-snapshot
Interior graphs of maximal outerplane 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/0196-6774(84)90045-2openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/j.dam.2014.03.008openalex-snapshot
The complexity of pebbling reachability and solvability in planar and outerplanar 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/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.1137/0607016openalex-snapshot
Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
inferred← citeshttps://doi.org/10.1587/transinf.2017fcp0007openalex-snapshot
Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes
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.