On the public citation graph
Minimal Cycle Bases of Outerplanar Graphs
0 signed · 62 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/andp.18471481202openalex-snapshot
Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird
inferredcites →https://doi.org/10.1002/jgt.3190130115openalex-snapshot
Is every cycle basis fundamental?
inferredcites →https://doi.org/10.1002/mana.19600220107openalex-snapshot
In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_5openalex-snapshot
On the Abstract Properties of Linear Dependence1
inferredcites →https://doi.org/10.1016/0012-365x(94)00023-copenalex-snapshot
A Family of special outerplanar graphs with only one triangle satisfying the cycle basis interpolation property
inferredcites →https://doi.org/10.1016/0020-0190(94)00231-mopenalex-snapshot
On finding a cycle basis with a shortest maximal cycle
inferredcites →https://doi.org/10.1021/c160040a013openalex-snapshot
Mathematical Basis of Ring-Finding Algorithms in CIDS
inferredcites →https://doi.org/10.1021/ci00063a007openalex-snapshot
Review of ring perception algorithms for chemical graphs
inferredcites →https://doi.org/10.1073/pnas.83.24.9373openalex-snapshot
Improved free-energy parameters for predictions of RNA duplex stability.
inferredcites →https://doi.org/10.1137/0120054openalex-snapshot
On Vector Spaces Associated with a Graph
inferredcites →https://doi.org/10.1137/0216026openalex-snapshot
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
inferredcites →https://doi.org/10.1145/355984.355988openalex-snapshot
Algorithms for Generating Fundamental Cycles in a Graph
inferredcites →https://doi.org/10.2307/2371182openalex-snapshot
On the Abstract Properties of Linear Dependence
inferredcites →https://doi.org/10.37236/1294openalex-snapshot
Union of all the Minimum Cycle Bases of a Graph
inferredcites →https://doi.org/10.5860/choice.30-5023openalex-snapshot
Structural mechanics: graph and matrix methods
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.5281/zenodo.9310openalex-extracted
Minimum Cycle Base Of Graphs Identified By Two Planar Graphs
inferred← citeshttps://doi.org/10.1002/3527600906.mcb.200500009openalex-snapshot
RNA Secondary Structures
inferred← citeshttps://doi.org/10.1002/net.21757openalex-snapshot
Computing cyclic invariants for molecular graphs
inferred← citeshttps://doi.org/10.1006/bulm.1998.0085openalex-snapshot
RNA Structures with Pseudo-knots: Graph-theoretical, Combinatorial, and Statistical Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_64openalex-snapshot
Finding Short Integral Cycle Bases for Cyclic Timetabling
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_31openalex-snapshot
On a Special Co-cycle Basis of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_44openalex-snapshot
New Approximation Algorithms for Minimum Cycle Bases of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_58openalex-snapshot
Minimum Cycle Bases of Weighted Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_20openalex-snapshot
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
inferred← citeshttps://doi.org/10.1007/s00200-008-0080-2openalex-snapshot
Gröbner bases and combinatorics for binary codes
inferred← citeshttps://doi.org/10.1007/s00285-007-0107-5openalex-snapshot
Variations on RNA folding and alignment: lessons from Benasque
inferred← citeshttps://doi.org/10.1007/s00373-015-1576-8openalex-snapshot
Finding Shorter Cycles in a Weighted Graph
inferred← citeshttps://doi.org/10.1007/s00453-009-9313-4openalex-snapshot
New Approximation Algorithms for Minimum Cycle Bases of Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-00984-2openalex-snapshot
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
inferred← citeshttps://doi.org/10.1007/s10114-009-7160-5openalex-snapshot
Minor and minimum cycle bases of a 3-connected planar graph
inferred← citeshttps://doi.org/10.1007/s10618-009-0162-1openalex-snapshot
Frequent subgraph mining in outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2015.06.053openalex-snapshot
Finding a shortest cycle in a subspace of the cycle space of a graph
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129296openalex-snapshot
The outerplanar Turán number of disjoint copies of paths
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.008openalex-snapshot
Characterization of minimum cycle basis in weighted partial 2-trees
inferred← citeshttps://doi.org/10.1016/j.ejc.2003.11.007openalex-snapshot
Generating cycle spaces for graphs on surfaces with small genera
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.092openalex-snapshot
Minimum cycle bases of graphs over different fields
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.12.012openalex-snapshot
Minimum cycle bases of direct products of complete graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.08.005openalex-snapshot
Minimum cycle bases of weighted outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2018.09.032openalex-snapshot
Length bounds for cycle bases of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.038openalex-snapshot
On minimum average stretch spanning trees in polygonal 2-trees
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00073-0openalex-snapshot
Combinatorics of RNA secondary structures
inferred← citeshttps://doi.org/10.1016/s0252-9602(17)30259-xopenalex-snapshot
CYCLE SPACES OF GRAPHS ON THE SPHERE AND THE PROJECTIVE PLANE
inferred← citeshttps://doi.org/10.1017/s0963548305007303openalex-snapshot
Generating Outerplanar Graphs Uniformly at Random
inferred← citeshttps://doi.org/10.1021/ci030405dopenalex-snapshot
Counterexamples in Chemical Ring Perception
inferred← citeshttps://doi.org/10.1080/00029890.2006.11920342openalex-snapshot
Noncrossing Partitions in Surprising Locations
inferred← citeshttps://doi.org/10.1089/10665270050081441openalex-snapshot
Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
inferred← citeshttps://doi.org/10.1137/060670730openalex-snapshot
Faster Algorithms for Minimum Cycle Basis in Directed Graphs
inferred← citeshttps://doi.org/10.1137/090760301openalex-snapshot
Combinatorics and Geometry of Finite and Infinite Squaregraphs
inferred← citeshttps://doi.org/10.1142/s0219525901000140openalex-snapshot
RELEVANT CYCLES IN CHEMICAL REACTION NETWORKS
inferred← citeshttps://doi.org/10.1145/1150402.1150427openalex-snapshot
Frequent subgraph mining in outerplanar graphs
inferred← citeshttps://doi.org/10.1145/3449639.3459280openalex-snapshot
A simple evolutionary algorithm guided by local mutations for an efficient RNA design
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.312.745openalex-snapshot
Cycle Bases Structure of out Planar Graphs on the Projective Plane in Mechanics Engineering
inferred← citeshttps://doi.org/10.48550/arxiv.1210.7919openalex-snapshot
Tree t-spanners in Outerplanar Graphs via Supply Demand Partition
inferred← citeshttps://doi.org/10.48550/arxiv.1303.0728openalex-snapshot
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0432openalex-snapshot
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees
inferred← citeshttps://doi.org/10.48550/arxiv.math/0511422openalex-snapshot
Enumeration of Unlabeled Outerplanar Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2157openalex-snapshot
A note on the fair domination number in outerplanar graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00325openalex-snapshot
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
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.