Trivially perfect graphs
From MaRDI portal
Publication:1248531
DOI10.1016/0012-365X(78)90178-4zbMATH Open0384.05057MaRDI QIDQ1248531FDOQ1248531
Authors: Martin Charles Golumbic 
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Normal hypergraphs and the perfect graph conjecture
- Incidence matrices and interval graphs
- A characterization of perfect graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (77)
- 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
- STRONG KOSZULNESS OF TORIC RINGS ASSOCIATED WITH STABLE SET POLYTOPES OF TRIVIALLY PERFECT GRAPHS
- The micro-world of cographs
- Linear separation of connected dominating sets in graphs
- Graphs with induced-saturation number zero
- Locally perfect graphs
- Linear optimization over homogeneous matrix cones
- Edge deletion problems: branching facilitated by modular decomposition
- Graph classes and forbidden patterns on three vertices
- Game-perfect graphs
- Enumerating threshold graphs and some related graph classes
- The chromatic symmetric functions of trivially perfect graphs and cographs
- The structure and the number of \(P_7\)-free bipartite graphs
- On Some Properties of the Struction of a Graph
- On characterizations for subclasses of directed co-graphs
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
- Title not available (Why is that?)
- On graphs with the smallest eigenvalue at least \(-1 - \sqrt{2} \). III
- On the rank of the distance matrix of graphs
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- On algorithms for (\(P_5\), gem)-free graphs
- Monotonic stable solutions for minimum coloring games
- 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
- Treelike comparability graphs
- Computing square roots of trivially perfect and threshold graphs
- Equistable simplicial, very well-covered, and line graphs
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- On low tree-depth decompositions
- 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
- Equality perfect graphs and digraphs
- Classes of perfect graphs
- Quasi-threshold graphs
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs
- The possible cardinalities of global secure sets in cographs
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
- Enumerative aspects of certain subclasses of perfect graphs
- 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}\)
- Hereditary efficiently dominatable graphs
- Square-Free Graphs with No Six-Vertex Induced Path
- On forcibly hereditary P-graphical sequences
- A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
- Augmenting graphs for independent sets
- More bounds for the Grundy number of graphs
- The Micro-world of Cographs
- Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)
- Neighborhood perfect graphs
- A note on sparseness conditions on chordless vertices of cycles
- Convex geometries over induced paths with bounded length
- Diameter estimates for graph associahedra
- Describing hereditary properties by forbidden circular orderings
- Characterization of classical graph classes by weighted clique graphs
- Integer Laplacian eigenvalues of chordal graphs
- Defective Coloring on Classes of Perfect Graphs
- Vertex deletion problems on chordal graphs
- Almost controllable graphs and beyond
- Computing optimal leaf roots of chordal cographs in linear time
- Distance ideals of graphs
- On graphs with 2 trivial distance ideals
- Containment orders – a lifelong journey
- 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
- Monopolar graphs: complexity of computing classical graph parameters
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing}
- On minimal forbidden subgraph characterizations of balanced graphs
- Clique-perfectness and balancedness of some graph classes
- Super domination: graph classes, products and enumeration
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)
