Pages that link to "Item:Q1025541"
From MaRDI portal
The following pages link to Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541):
Displaying 13 items.
- Clique-perfectness of claw-free planar graphs (Q503649) (← links)
- Claw-free cubic graphs with clique-transversal number half of their order (Q533447) (← links)
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs (Q1944214) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- About some robustness and complexity properties of \(G\)-graphs networks (Q2255041) (← links)
- The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (Q3195131) (← links)
- Clique-perfectness of complements of line graphs (Q5891101) (← 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)
