The following pages link to Weakly triangulated graphs (Q801088):
Displaying 50 items.
- A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- On Roussel-Rubio-type lemmas and their consequences (Q533774) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- Meyniel weakly triangulated graphs. I: Co-perfect orderability (Q678852) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Independent domination in hereditary classes (Q818132) (← links)
- On a conjecture of Hoàng and Tu concerning perfectly orderable graphs (Q860461) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Covering orthogonal polygons with star polygons: The perfect graph approach (Q918225) (← links)
- A magnetic procedure for the stability number (Q968215) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← links)
- Murky graphs (Q1101470) (← links)
- A new property of critical imperfect graphs and some consequences (Q1104342) (← links)
- Locally perfect graphs (Q1105623) (← links)
- A characterization of interval catch digraphs (Q1118608) (← links)
- Opposition graphs are strict quasi-parity graphs (Q1118614) (← links)
- Recognizing claw-free perfect graphs (Q1118619) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Short-chorded and perfect graphs (Q1174781) (← links)
- Finding large holes (Q1182105) (← links)
- A charming class of perfectly orderable graphs (Q1193431) (← links)
- On probe interval graphs (Q1281778) (← links)
- On the disc-structure of perfect graphs. I: The co-paw-structure (Q1293203) (← links)
- The maximum clique problem (Q1318271) (← links)
- Polyominos and perfect graphs (Q1322110) (← links)
- Slightly triangulated graphs are perfect (Q1340126) (← links)
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- Path parity and perfection (Q1356748) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Perfect graphs with unique \(P_ 4\)-structure (Q1356763) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666) (← links)
- Meyniel weakly triangulated graphs. II: A theorem of Dirac (Q1377671) (← links)
- A note on \(r\)-dominating cliques (Q1382816) (← links)
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs (Q1390873) (← links)
- Homogeneously orderable graphs (Q1392023) (← links)
- On simplicial and co-simplicial vertices in graphs. (Q1428559) (← links)
- Tree-like \(P_4\)-connected graphs (Q1584426) (← links)
- Quasi-star-cutsets and some consequences (Q1600840) (← links)
- NeST graphs (Q1613397) (← links)
- Mock threshold graphs (Q1637131) (← links)
- Some problems on induced subgraphs (Q1693168) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
