The following pages link to Trivially perfect graphs (Q1248531):
Displaying 50 items.
- Graphs with induced-saturation number zero (Q276201) (← links)
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- A note on sparseness conditions on chordless vertices of cycles (Q385389) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- Augmenting graphs for independent sets (Q705491) (← links)
- The possible cardinalities of global secure sets in cographs (Q764303) (← links)
- Freeness of hyperplane arrangements between Boolean arrangements and Weyl arrangements of type \(B_{\ell}\) (Q783056) (← 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)
- The micro-world of cographs (Q831855) (← links)
- On low tree-depth decompositions (Q897253) (← 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)
- Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\) (Q1618244) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- The chromatic symmetric functions of trivially perfect graphs and cographs (Q1756046) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← 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)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- Convex geometries over induced paths with bounded length (Q2092354) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- Describing hereditary properties by forbidden circular orderings (Q2096309) (← links)
- The \(e\)-positivity and Schur positivity of some spiders and broom trees (Q2104941) (← links)
- On the rank of the distance matrix of graphs (Q2161884) (← links)
- On graphs with 2 trivial distance ideals (Q2174093) (← links)
- Between clique-width and linear clique-width of bipartite graphs (Q2185929) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
- Integer Laplacian eigenvalues of chordal graphs (Q2229473) (← links)
- Monotonic stable solutions for minimum coloring games (Q2248763) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- Distance ideals of graphs (Q2332421) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Equistable simplicial, very well-covered, and line graphs (Q2448905) (← links)
