The following pages link to (Q3428669):
Displaying 17 items.
- Clique-perfectness of claw-free planar graphs (Q503649) (← links)
- NP-hardness of the recognition of coordinated graphs (Q839773) (← links)
- Bounds on the clique-transversal number of regular graphs (Q943436) (← links)
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Discrete Morse theory and the homotopy type of clique graphs (Q2441385) (← links)
- Edge contraction and edge removal on iterated clique graphs (Q2446322) (← links)
- Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type (Q2481813) (← links)
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (Q2482103) (← links)
- On the clique behavior of circulants with three small jumps (Q2840560) (← links)
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (Q3195131) (← links)
- Characterization and recognition of Helly circular-arc clique-perfect graphs (Q3439325) (← links)
- Random Graphs, Retractions and Clique Graphs (Q3503566) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900083) (← links)
