The following pages link to Trivially perfect graphs (Q1248531):
Displaying 24 items.
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- (Q3303537) (← links)
- On Some Properties of the Struction of a Graph (Q3328582) (← links)
- A new characterization of trivially perfect graphs (Q5006549) (← links)
- The Micro-world of Cographs (Q5041177) (← links)
- Enumerating threshold graphs and some related graph classes (Q5080334) (← links)
- (Q5136273) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- On graphs with the smallest eigenvalue at least −1 − √2, part III (Q5217093) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- STRONG KOSZULNESS OF TORIC RINGS ASSOCIATED WITH STABLE SET POLYTOPES OF TRIVIALLY PERFECT GRAPHS (Q5414227) (← links)
- (Q5708495) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- Defective Coloring on Classes of Perfect Graphs (Q5864723) (← links)
- The structure and the number of \(P_7\)-free bipartite graphs (Q5920066) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5920323) (← links)
- Linear optimization over homogeneous matrix cones (Q6047504) (← links)
- Almost controllable graphs and beyond (Q6056472) (← links)
- Super domination: graph classes, products and enumeration (Q6130203) (← links)
