On the public citation graph
Optimizing weakly triangulated graphs
0 signed · 96 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.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01788689openalex-snapshot
Optimizing weakly triangulated graphs
inferredcites →https://doi.org/10.1016/0095-8956(85)90050-4openalex-snapshot
Weakly triangulated graphs
inferredcites →https://doi.org/10.1016/0095-8956(91)90078-xopenalex-snapshot
Two classes of perfect graphs
inferredcites →https://doi.org/10.1016/s0195-6698(87)80037-9openalex-snapshot
A New Property of Critical Imperfect Graphs and some Consequences
inferredcites →https://doi.org/10.1016/s0304-0208(08)72943-8openalex-snapshot
Polynomial Algorithms for Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7148-8openalex-snapshot
Topics on Perfect Graphs
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199912)32:4<359::aid-jgt5>3.0.co;2-uopenalex-snapshot
Perfectly contractile diamond-free graphs
inferred← citeshttps://doi.org/10.1006/jctb.1995.1048openalex-snapshot
A Characterization of Some Graph Classes with No Long Holes
inferred← citeshttps://doi.org/10.1006/jctb.1996.0042openalex-snapshot
On theP4-Structure of Perfect Graphs V. Overlap Graphs
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_3openalex-snapshot
On the coloration of perfect graphs
inferred← citeshttps://doi.org/10.1007/11917496_22openalex-snapshot
Finding Intersection Models of Weakly Chordal Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_13openalex-snapshot
Recognizing Weakly Triangulated Graphs by Edge Separability
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_85openalex-snapshot
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45470-5_19openalex-snapshot
Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_29openalex-snapshot
Critical and Anticritical Edges in Perfect Graphs
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-59071-4_39openalex-snapshot
On domination elimination orderings and domination graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-26626-8_43openalex-snapshot
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_7openalex-snapshot
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_43openalex-snapshot
The PIGs Full Monty – A Floor Show of Minimal Separators
inferred← citeshttps://doi.org/10.1007/978-3-540-44827-3_1openalex-snapshot
Protein Structure Comparison: Algorithms and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_31openalex-snapshot
A Note on k-Colorability of P 5-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_25openalex-snapshot
What Is between Chordal and Weakly Chordal Graphs?
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_17openalex-snapshot
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-66491-9_4openalex-snapshot
Generating Weakly Chordal Graphs from Arbitrary Graphs
inferred← citeshttps://doi.org/10.1007/978-3-7643-7400-6_14openalex-snapshot
Even Pairs in Bull-reducible Graphs
inferred← citeshttps://doi.org/10.1007/bf01202235openalex-snapshot
On the structure of bull-free perfect graphs
inferred← citeshttps://doi.org/10.1007/bf01788660openalex-snapshot
Opposition graphs are strict quasi-parity graphs
inferred← citeshttps://doi.org/10.1007/bf02986675openalex-snapshot
Slightly triangulated graphs are perfect
inferred← citeshttps://doi.org/10.1007/bfb0024492openalex-snapshot
Algorithms for the treewidth and minimum fill-in of HHD-free graphs
inferred← citeshttps://doi.org/10.1007/s00373-010-0886-0openalex-snapshot
A Magnetic Procedure for the Stability Number
inferred← citeshttps://doi.org/10.1007/s00373-010-0922-0openalex-snapshot
A Min–Max Property of Chordal Bipartite Graphs with Applications
inferred← citeshttps://doi.org/10.1007/s00453-008-9197-8openalex-snapshot
Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
inferred← citeshttps://doi.org/10.1007/s00500-005-0507-7openalex-snapshot
Maximal sub-triangulation in pre-processing phylogenetic data
inferred← citeshttps://doi.org/10.1007/s10107-005-0649-5openalex-snapshot
Independent packings in structured graphs
inferred← citeshttps://doi.org/10.1007/s10878-016-0035-7openalex-snapshot
Approximation of knapsack problems with conflict and forcing graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90338-topenalex-snapshot
Counterexamples to three conjectures concerning perfect graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00052-kopenalex-snapshot
Powers of distance-hereditary graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00330-lopenalex-snapshot
Even pairs and the strong perfect graph conjecture
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00350-ropenalex-snapshot
On edge perfectness and classes of bipartite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00156-qopenalex-snapshot
Some properties of minimal imperfect graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00017-4openalex-snapshot
Polyominos and perfect graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90135-mopenalex-snapshot
On the P4-structure of Perfect Graphs. IV. Partner graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90033-sopenalex-snapshot
An efficient algorithm for finding a two-pair, and its applications
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90165-kopenalex-snapshot
Neighborhood subtree tolerance graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0161-qopenalex-snapshot
Algorithms for weakly triangulated graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90104-xopenalex-snapshot
Algorithms for interval catch digraphs
inferred← citeshttps://doi.org/10.1016/j.akcej.2016.11.008openalex-snapshot
New graph classes characterized by weak vertex separators and two-pairs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.017openalex-snapshot
Intersection models of weakly chordal graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.05.011openalex-snapshot
Transitive orientations in bull-reducible Berge graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.04.023openalex-snapshot
The complexity of dissociation set problems in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.04.016openalex-snapshot
Finding clubs in graph classes
inferred← citeshttps://doi.org/10.1016/j.dam.2014.11.018openalex-snapshot
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.002openalex-snapshot
A vertex incremental approach for maintaining chordality
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.064openalex-snapshot
Representing edge intersection graphs of paths on degree 4 trees
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.063openalex-snapshot
A new characterization of HH-free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.01.013openalex-snapshot
On Roussel–Rubio-type lemmas and their consequences
inferred← citeshttps://doi.org/10.1016/j.disc.2012.12.023openalex-snapshot
On the separability of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.08.015openalex-snapshot
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111733openalex-snapshot
Reconfiguration graph for vertex colourings of weakly chordal graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.09.015openalex-snapshot
Maximum Weight Independent Sets in hole- and co-chair-free graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.006openalex-snapshot
The induced matching and chain subgraph cover problems for convex bipartite graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00803-8openalex-snapshot
Finding a maximum induced matching in weakly chordal graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00174-4openalex-snapshot
Path parity and perfection
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00346-5openalex-snapshot
Even pairs in Artemis graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00390-1openalex-snapshot
Induced matchings in asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00091-6openalex-snapshot
Homogeneously orderable graphs
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00213-2openalex-snapshot
Quasi-star-cutsets and some consequences
inferred← citeshttps://doi.org/10.1017/cbo9781139506748.008openalex-snapshot
The world of hereditary graph classes viewed through Truemper configurations
inferred← citeshttps://doi.org/10.1109/cict51604.2020.9312070openalex-snapshot
On 3-Degree 4-Chordal Graphs
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518022openalex-snapshot
Topological Interference Management with Adversarial Perturbation
inferred← citeshttps://doi.org/10.1137/s0097539797322334openalex-snapshot
Weakly Triangulated Comparability Graphs
inferred← citeshttps://doi.org/10.1137/s0097539799359683openalex-snapshot
Treewidth and Minimum Fill-in: Grouping the Minimal Separators
inferred← citeshttps://doi.org/10.1137/s0895480198339237openalex-snapshot
Optimizing Bull-Free Perfect Graphs
inferred← citeshttps://doi.org/10.1142/s1793830914500311openalex-snapshot
Symmetric graph-theoretic roles of two-pairs and chords of cycles
inferred← citeshttps://doi.org/10.1142/s1793830920500391openalex-snapshot
A separator-based method for generating weakly chordal graphs
inferred← citeshttps://doi.org/10.1142/s1793830922500537openalex-snapshot
On 3-degree 4-chordal graphs
inferred← citeshttps://doi.org/10.1145/1240233.1240237openalex-snapshot
Improved algorithms for weakly chordal graphs
inferred← citeshttps://doi.org/10.1145/73393.73415openalex-snapshot
Covering orthogonal polygons with star polygons: the perfect graph approach
inferred← citeshttps://doi.org/10.1287/trsc.26.2.138openalex-snapshot
Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
inferred← citeshttps://doi.org/10.3182/20090603-3-ru-2001.0071openalex-snapshot
On the Complexity of Dissociation Set Problems in Graphs
inferred← citeshttps://doi.org/10.4153/cmb-2015-013-3openalex-snapshot
Cover Product and Betti Polynomial of Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.3439openalex-snapshot
Representations of Edge Intersection Graphs of Paths in a Tree
inferred← citeshttps://doi.org/10.48550/arxiv.1309.0119openalex-snapshot
Graphes parfaits : structure et algorithmes
inferred← citeshttps://doi.org/10.48550/arxiv.1812.11400openalex-snapshot
Nonvanishing Betti Numbers of Weakly Chordal Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0609083openalex-snapshot
k-Colorability of P5-free graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702043openalex-snapshot
Deciding k-colourability of $P_5$-free graphs in polynomial time
inferred← citeshttps://doi.org/10.5555/338219.338231openalex-snapshot
Weakly chordal graph algorithms via handles
inferred← citeshttps://doi.org/10.82308/16876openalex-snapshot
Claw-free graphs and two conjectures on omega, Delta, and chi
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.