Pages that link to "Item:Q1822967"
From MaRDI portal
The following pages link to Optimizing weakly triangulated graphs (Q1822967):
Displaying 41 items.
- Finding clubs in graph classes (Q400518) (← links)
- On Roussel-Rubio-type lemmas and their consequences (Q533774) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- Preperfect graphs (Q684406) (← links)
- Linearity defect of edge ideals and Fröberg's theorem (Q737978) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- A new characterization of HH-free graphs (Q942119) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Intersection models of weakly chordal graphs (Q1026105) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- Opposition graphs are strict quasi-parity graphs (Q1118614) (← links)
- The maximum clique problem (Q1318271) (← links)
- Polyominos and perfect graphs (Q1322110) (← links)
- Alternating cycle-free matchings (Q1325959) (← links)
- Algorithms for interval catch digraphs (Q1329814) (← links)
- Slightly triangulated graphs are perfect (Q1340126) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Quasi-star-cutsets and some consequences (Q1600840) (← links)
- Sum-perfect graphs (Q1735702) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- On the \(P_ 4\)-structure of perfect graphs. IV: Partner graphs (Q1812828) (← links)
- Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)] (Q1813714) (← links)
- Even pairs and the strong perfect graph conjecture (Q1918559) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q2286594) (← links)
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 (Q2374177) (← links)
- Representing edge intersection graphs of paths on degree 4 trees (Q2476278) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
- A class of perfectly contractile graphs (Q2581496) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- (Q3301019) (← links)
- Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
- A Note on k-Colorability of P 5-Free Graphs (Q3599143) (← links)
- What Is between Chordal and Weakly Chordal Graphs? (Q5302062) (← links)
- A separator-based method for generating weakly chordal graphs (Q5858151) (← links)
- Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes (Q5859496) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
- Nonvanishing Betti numbers of edge ideals of weakly chordal graphs (Q6171761) (← links)
