The following pages link to Trivially perfect graphs (Q1248531):
Displayed 24 items.
- Augmenting graphs for independent sets (Q705491) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- Game-perfect graphs (Q1014302) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- Probe threshold and probe trivially perfect graphs (Q1034600) (← links)
- A note on superbrittle graphs (Q1081614) (← links)
- Neighborhood perfect graphs (Q1081622) (← links)
- Locally perfect graphs (Q1105623) (← links)
- Enumerative aspects of certain subclasses of perfect graphs (Q1301836) (← links)
- Longest cycles in threshold graphs (Q1343260) (← links)
- A characterization of moral transitive acyclic directed graph Markov models as labeled trees. (Q1395885) (← links)
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem (Q1414587) (← links)
- A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- On forcibly hereditary P-graphical sequences (Q1820175) (← links)
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs (Q1894513) (← links)
- Homomorphically full graphs (Q1917297) (← links)
- Quasi-threshold graphs (Q1923584) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- On Some Properties of the Struction of a Graph (Q3328582) (← links)
- (Q5708495) (← links)