The following pages link to Neighborhood perfect graphs (Q1081622):
Displaying 26 items.
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
- Neighbourhood-perfect line graphs (Q1343228) (← links)
- Approximating weighted neighborhood independent sets (Q1679903) (← links)
- Block duplicate graphs and a hierarchy of chordal graphs (Q1850116) (← links)
- On edge perfectness and classes of bipartite graphs (Q1910576) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (Q2482103) (← links)
- Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
- On balanced graphs (Q2583124) (← links)
- (Q2861542) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (Q3195131) (← links)
- Characterization and recognition of Helly circular-arc clique-perfect graphs (Q3439325) (← links)
- Restricted unimodular chordal graphs (Q4229266) (← links)
- An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs (Q4780532) (← links)
- An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph (Q4917098) (← links)
- Minimum r-neighborhood covering set of permutation graphs (Q5025160) (← links)
- The<i>k</i>-neighbourhood-covering problem on interval graphs (Q5747730) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900083) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900860) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
