Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3515502 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3618209 (Why is no real title available?)
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- A Note on "The Comparability Graph of a Tree"
- A characterisation of rigid circuit graphs
- A characterization of perfect graphs
- Incidence matrices and interval graphs
- Normal hypergraphs and the perfect graph conjecture
Cited in
(85)- Orientations without forbidden patterns on three vertices
- Super domination: graph classes, products and enumeration
- Longest cycles in threshold graphs
- On retracts, absolute retracts, and foldings in cographs
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- The \(e\)-positivity and Schur positivity of some spiders and broom trees
- The micro-world of cographs
- STRONG KOSZULNESS OF TORIC RINGS ASSOCIATED WITH STABLE SET POLYTOPES OF TRIVIALLY PERFECT GRAPHS
- Graphs with induced-saturation number zero
- Locally perfect graphs
- Linear separation of connected dominating sets in graphs
- Characterization of classical graph classes by weighted clique graphs
- Linear optimization over homogeneous matrix cones
- Edge deletion problems: branching facilitated by modular decomposition
- Game-perfect graphs
- Graph classes and forbidden patterns on three vertices
- Integer Laplacian eigenvalues of chordal graphs
- The chromatic symmetric functions of trivially perfect graphs and cographs
- Enumerating threshold graphs and some related graph classes
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
- On Some Properties of the Struction of a Graph
- The structure and the number of \(P_7\)-free bipartite graphs
- On characterizations for subclasses of directed co-graphs
- Defective Coloring on Classes of Perfect Graphs
- Vertex deletion problems on chordal graphs
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- On the rank of the distance matrix of graphs
- scientific article; zbMATH DE number 2230209 (Why is no real title available?)
- On graphs with the smallest eigenvalue at least \(-1 - \sqrt{2} \). III
- Almost controllable graphs and beyond
- On algorithms for (P₅, gem)-free graphs
- Monotonic stable solutions for minimum coloring games
- Computing optimal leaf roots of chordal cographs in linear time
- Homomorphically full graphs
- Star coloring of certain graph classes
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- A new characterization of trivially perfect graphs
- Distance ideals of graphs
- Treelike comparability graphs
- On low tree-depth decompositions
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Computing square roots of trivially perfect and threshold graphs
- Equistable simplicial, very well-covered, and line graphs
- Vertex deletion problems on chordal graphs
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- Probe threshold and probe trivially perfect graphs
- Classes of perfect graphs
- Equality perfect graphs and digraphs
- Quasi-threshold graphs
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs
- The possible cardinalities of global secure sets in cographs
- On graphs with 2 trivial distance ideals
- Quantum algorithms for graph coloring and other partitioning, covering, and packing problems
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
- Enumerative aspects of certain subclasses of perfect graphs
- Containment orders – a lifelong journey
- Characterization of double-arborescences and their minimum length word-representants
- Weighted efficient domination for P₈-free bipartite graphs in polynomial time
- A note on superbrittle graphs
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem
- Freeness of hyperplane arrangements between Boolean arrangements and Weyl arrangements of type \(B_{\ell}\)
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- On two variants of split graphs: 2-unipolar graph and k-probe-split graph
- Between clique-width and linear clique-width of bipartite graphs
- Hereditary efficiently dominatable graphs
- Monopolar graphs: complexity of computing classical graph parameters
- On forcibly hereditary P-graphical sequences
- Tree-layout based graph classes: proper chordal graphs
- Square-Free Graphs with No Six-Vertex Induced Path
- Augmenting graphs for independent sets
- A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing}
- More bounds for the Grundy number of graphs
- On minimal forbidden subgraph characterizations of balanced graphs
- Subgroups of Bestvina-Brady groups
- An improved kernelization algorithm for trivially perfect editing
- Contractions in perfect graphs
- Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)
- The Micro-world of Cographs
- A note on sparseness conditions on chordless vertices of cycles
- Neighborhood perfect graphs
- Clique-perfectness and balancedness of some graph classes
- Convex geometries over induced paths with bounded length
- Diameter estimates for graph associahedra
- Describing hereditary properties by forbidden circular orderings
This page was built for publication: Trivially perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1248531)
