Recommendations
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3332242 (Why is no real title available?)
- A Note on "The Comparability Graph of a Tree"
- A characterisation of rigid circuit graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Characterizations of strongly chordal graphs
- Graphs whose neighborhoods have no special cycles
- Khachiyan’s algorithm for linear programming
- Representation of a finite graph by a set of intervals on the real line
- Representations of chordal graphs as subtrees of a tree
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The line neighbourhood number of a graph
- Trivially perfect graphs
Cited in
(34)- scientific article; zbMATH DE number 1186103 (Why is no real title available?)
- Algorithmic aspects of clique-transversal and clique-independent sets
- On some graph classes related to perfect graphs: a survey
- scientific article; zbMATH DE number 2042776 (Why is no real title available?)
- Minimal non-neighborhood-perfect graphs
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- The \(k\)-neighbourhood-covering problem on interval graphs
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs
- scientific article; zbMATH DE number 3970803 (Why is no real title available?)
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- Balancedness of some subclasses of circular-arc graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs
- A characterization of star-perfect graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- 1-Triangle graphs and perfect neighborhood sets
- Neighbourhood-perfect line graphs
- Clique-perfectness and balancedness of some graph classes
- Graphs whose neighborhoods have no special cycles
- Clique-perfectness of complements of line graphs
- Variations of \(Y\)-dominating functions on graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Approximating weighted neighborhood independent sets
- Distance-hereditary graphs are clique-perfect
- Minimum \(r\)-neighborhood covering set of permutation graphs
- scientific article; zbMATH DE number 15158 (Why is no real title available?)
- Variations of maximum-clique transversal sets on graphs
- Block duplicate graphs and a hierarchy of chordal graphs
- Restricted unimodular chordal graphs
- On balanced graphs
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
- On edge perfectness and classes of bipartite graphs
- An efficient algorithm for Helly property recognition in a linear hypergraph
This page was built for publication: Neighborhood perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081622)
