On the public citation graph

Characterization of partial 3-trees in terms of three structures

https://doi.org/10.1007/bf01788098
0 signed · 19 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.3230110304openalex-snapshot
Networks immune to isolated failures
inferredcites →https://doi.org/10.1002/net.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
inferredcites →https://doi.org/10.1016/0012-365x(74)90042-9openalex-snapshot
On simple characterizations of k-trees
inferredcites →https://doi.org/10.1016/0012-365x(84)90164-xopenalex-snapshot
Separating subgraphs in k-trees: Cables and caterpillars
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50018-0openalex-snapshot
A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
inferredcites →https://doi.org/10.1112/s0025579300008500openalex-snapshot
Properties and characterizations of k ‐trees

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.3230200304openalex-snapshot
A characterization of partial 3‐trees
inferred← citeshttps://doi.org/10.1006/inco.2000.2958openalex-snapshot
Reduction Algorithms for Graphs of Small Treewidth
inferred← citeshttps://doi.org/10.1006/jagm.1999.1011openalex-snapshot
Graphs with Branchwidth at Most Three
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_217openalex-snapshot
Constructive linear time algorithms for branchwidth
inferred← citeshttps://doi.org/10.1007/bfb0017382openalex-snapshot
An algebraic theory of graph reduction
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90023-xopenalex-snapshot
The nonexistence of reduction rules giving an embedding into a k-tree
inferred← citeshttps://doi.org/10.1016/j.dam.2017.01.030openalex-snapshot
Minimum size tree-decompositions
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00175-xopenalex-snapshot
Algorithms and obstructions for linear-width and related search parameters
inferred← citeshttps://doi.org/10.1080/09528139308953776openalex-snapshot
Graph decompositions and tree automata in reasoning with uncertainty
inferred← citeshttps://doi.org/10.1109/iscas.1990.112560openalex-snapshot
Minimal forbidden minor characterization of planar partial 3-trees and application to circuit layout
inferred← citeshttps://doi.org/10.1137/s0895480193243043openalex-snapshot
On Linear Recognition of Tree-Width at Most Four
inferred← citeshttps://doi.org/10.1145/174147.169807openalex-snapshot
An algebraic theory of graph reduction
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.