scientific article
From MaRDI portal
Publication:3428669
zbMath1224.05358MaRDI QIDQ3428669
Guillermo Durán, Marina Groshaus, Jayme Luiz Szwarcfiter, Flavia Bonomo-Braberman
Publication date: 29 March 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Related Items (17)
NP-hardness of the recognition of coordinated graphs ⋮ Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths ⋮ On some graph classes related to perfect graphs: a survey ⋮ Random Graphs, Retractions and Clique Graphs ⋮ Variations of maximum-clique transversal sets on graphs ⋮ Discrete Morse theory and the homotopy type of clique graphs ⋮ Edge contraction and edge removal on iterated clique graphs ⋮ Bounds on the clique-transversal number of regular graphs ⋮ Clique-perfectness of claw-free planar graphs ⋮ Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs ⋮ Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type ⋮ Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs ⋮ The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness ⋮ Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs ⋮ On the clique behavior of circulants with three small jumps ⋮ The clique-perfectness and clique-coloring of outer-planar graphs ⋮ Characterization and recognition of Helly circular-arc clique-perfect graphs
This page was built for publication:
