scientific article; zbMATH DE number 553916
From MaRDI portal
Publication:4288086
zbMath0794.05113MaRDI QIDQ4288086
Publication date: 21 April 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
perfect graphclique graphcliquechordal graphrecognition algorithmirreducible graphshereditary clique-Helly graphclique-Helly graphhereditary irreducible graphs
Related Items (43)
Maximum \(h\)-colourable subgraph problem in balanced graphs ⋮ On the clique behavior of graphs of low degree ⋮ A unified approach to recognize squares of split graphs ⋮ Faster recognition of clique-Helly and hereditary clique-Helly graphs ⋮ On neighborhood-Helly graphs ⋮ Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths ⋮ Transversal partitioning in balanced hypergraphs ⋮ On clique-complete graphs ⋮ Split clique graph complexity ⋮ On some graph classes related to perfect graphs: a survey ⋮ Weighted maximum-clique transversal sets of graphs ⋮ On the generalized Helly property of hypergraphs, cliques, and bicliques ⋮ Variations of maximum-clique transversal sets on graphs ⋮ Balanced matrices ⋮ Characterization of classical graph classes by weighted clique graphs ⋮ Characterization and recognition of generalized clique-Helly graphs ⋮ Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs ⋮ Clique-perfectness of claw-free planar graphs ⋮ Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs ⋮ On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs ⋮ Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs ⋮ On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs ⋮ The P versus NP-complete dichotomy of some challenging problems in graph theory ⋮ On edge-sets of bicliques in graphs ⋮ On the strong \(p\)-Helly property ⋮ Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs ⋮ On hereditary clique-Helly self-clique graphs ⋮ The clique operator on graphs with few \(P_{4}\)'s ⋮ Unnamed Item ⋮ Recognizing Helly edge-path-tree graphs and their clique graphs ⋮ On the relation of strong triadic closure and cluster deletion ⋮ On minimal forbidden subgraph characterizations of balanced graphs ⋮ Self‐clique graphs and matrix permutations ⋮ Partial characterizations of coordinated graphs: Line graphs and complements of forests ⋮ The complexity of clique graph recognition ⋮ On minimal forbidden subgraph characterizations of balanced graphs ⋮ Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs ⋮ The clique operator on cographs and serial graphs ⋮ A superclass of edge-path-tree graphs with few cliques ⋮ A new characterization of strongly chordal graphs ⋮ Characterizing flag graphs and incuced subgraphs of Cartesian product graphs ⋮ On balanced graphs ⋮ Helly Property and Sandwich Graphs
This page was built for publication:
