Trivially perfect graphs
From MaRDI portal
Publication:1248531
DOI10.1016/0012-365X(78)90178-4zbMath0384.05057MaRDI QIDQ1248531
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations, Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\), Graphs with induced-saturation number zero, A note on superbrittle graphs, Neighborhood perfect graphs, The Micro-world of Cographs, The micro-world of cographs, Longest cycles in threshold graphs, Unnamed Item, A clique tree algorithm for partitioning a chordal graph into transitive subgraphs, Locally perfect graphs, On the rank of the distance matrix of graphs, Clique-perfectness and balancedness of some graph classes, Monopolar graphs: complexity of computing classical graph parameters, Homomorphically full graphs, Hereditary Efficiently Dominatable Graphs, On graphs with 2 trivial distance ideals, Quasi-threshold graphs, Color-bounded hypergraphs. VI: Structural and functional jumps in complexity, A note on sparseness conditions on chordless vertices of cycles, Between clique-width and linear clique-width of bipartite graphs, Linear optimization over homogeneous matrix cones, Almost controllable graphs and beyond, A characterization of moral transitive acyclic directed graph Markov models as labeled trees., On low tree-depth decompositions, Super domination: graph classes, products and enumeration, Maximizing the strong triadic closure in split graphs and proper interval graphs, Classes of perfect graphs, A cubic vertex-kernel for \textsc{Trivially Perfect Editing}, Star coloring of certain graph classes, \(P_{5}\)-free augmenting graphs and the maximum stable set problem, Computing square roots of trivially perfect and threshold graphs, A fully dynamic algorithm for modular decomposition and recognition of cographs., Equistable simplicial, very well-covered, and line graphs, Characterization of classical graph classes by weighted clique graphs, (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization., Integer Laplacian eigenvalues of chordal graphs, More bounds for the Grundy number of graphs, Enumerating threshold graphs and some related graph classes, On retracts, absolute retracts, and foldings in cographs, Monotonic stable solutions for minimum coloring games, STRONG KOSZULNESS OF TORIC RINGS ASSOCIATED WITH STABLE SET POLYTOPES OF TRIVIALLY PERFECT GRAPHS, The chromatic symmetric functions of trivially perfect graphs and cographs, A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements, On Some Properties of the Struction of a Graph, Edge deletion problems: branching facilitated by modular decomposition, Augmenting graphs for independent sets, Maximum independent sets in subclasses of \(P_{5}\)-free graphs, On characterizations for subclasses of directed co-graphs, Vertex deletion problems on chordal graphs, The structure and the number of \(P_7\)-free bipartite graphs, On graphs with the smallest eigenvalue at least −1 − √2, part III, Game-perfect graphs, On minimal forbidden subgraph characterizations of balanced graphs, Linear separation of connected dominating sets in graphs, Treelike comparability graphs, On forcibly hereditary P-graphical sequences, Square-Free Graphs with No Six-Vertex Induced Path, The possible cardinalities of global secure sets in cographs, Unnamed Item, Unnamed Item, Probe threshold and probe trivially perfect graphs, Freeness of hyperplane arrangements between Boolean arrangements and Weyl arrangements of type \(B_{\ell}\), Distance ideals of graphs, Enumerative aspects of certain subclasses of perfect graphs, Convex geometries over induced paths with bounded length, A new characterization of trivially perfect graphs, Diameter estimates for graph associahedra, Graph Classes and Forbidden Patterns on Three Vertices, Describing hereditary properties by forbidden circular orderings, Defective Coloring on Classes of Perfect Graphs, The \(e\)-positivity and Schur positivity of some spiders and broom trees, Vertex Deletion Problems on Chordal Graphs, On algorithms for (\(P_5\), gem)-free graphs
Cites Work
- A characterisation of rigid circuit graphs
- Incidence matrices and interval graphs
- A characterization of perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- A Note on "The Comparability Graph of a Tree"
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
