On the public citation graph

Treewidth of circle graphs

https://doi.org/10.1007/bfb0045385
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 points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1996.0049openalex-snapshot
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1998.0936openalex-snapshot
Minimum Fill-in on Circle and Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45753-4_8openalex-snapshot
1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_18openalex-snapshot
Treewidth and Minimum Fill-In of Weakly Triangulated Graphs
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_61openalex-snapshot
Computing treewidth and minimum fill-in: All you need are the minimal separators
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_188openalex-snapshot
Finding all minimal separators of a graph
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_68openalex-snapshot
How to use the minimal separators of a graph for its chordal triangulation
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_133openalex-snapshot
Minimum fill-in on circle and circular-arc graphs
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_29openalex-snapshot
Minimal Triangulations for Graphs with “Few” Minimal Separators
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_22openalex-snapshot
On the Treewidth and Pathwidth of Biconvex Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/bfb0029946openalex-snapshot
Treewidth: Algorithmic techniques and results
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00230-9openalex-snapshot
Chordal embeddings of planar graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00031-0openalex-snapshot
Treewidth for graphs with small chordality
inferred← citeshttps://doi.org/10.1093/comjnl/bxm033openalex-snapshot
The Bidimensionality Theory and Its Algorithmic Applications
inferred← citeshttps://doi.org/10.1137/s009753979427087xopenalex-snapshot
Listing all Minimal Separators of a Graph
inferred← citeshttps://doi.org/10.1137/s0097539799359683openalex-snapshot
Treewidth and Minimum Fill-in: Grouping the Minimal Separators
inferred← citeshttps://doi.org/10.1142/9789812777638_0008openalex-snapshot
Treewidth and Minimum Fill-in on d-Trapezoid Graphs
inferred← citeshttps://doi.org/10.37236/10035openalex-snapshot
Treewidth of the Generalized Kneser Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2101.04518openalex-snapshot
Treewidth of the $q$-Kneser graphs
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.