scientific article; zbMATH DE number 553916
From MaRDI portal
Publication:4288086
zbMATH Open0794.05113MaRDI QIDQ4288086FDOQ4288086
Authors: Erich Prisner 
Publication date: 21 April 1994
Title of this publication is not available (Why is that?)
Recommendations
cliqueperfect graphchordal graphrecognition algorithmclique graphirreducible graphshereditary clique-Helly graphclique-Helly graphhereditary irreducible graphs
Cited In (46)
- Split clique graph complexity
- On the strong \(p\)-Helly property
- Helly Property and Sandwich Graphs
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- Clique irreducibility and clique vertex irreducibility of graphs
- The clique operator on graphs with few \(P_{4}\)'s
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Weighted maximum-clique transversal sets of graphs
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- Characterization of classical graph classes by weighted clique graphs
- Partial characterizations of coordinated graphs: Line graphs and complements of forests
- On the generalized Helly property of hypergraphs, cliques, and bicliques
- On clique-complete graphs
- A superclass of edge-path-tree graphs with few cliques
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- The clique operator on cographs and serial graphs
- Clique-perfectness of claw-free planar graphs
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Clique cycle-transversals in distance-hereditary graphs
- On edge-sets of bicliques in graphs
- On minimal forbidden subgraph characterizations of balanced graphs
- On the clique behavior of graphs of low degree
- A new characterization of strongly chordal graphs
- On irreducibility and Helly properties of maximal cliques
- A unified approach to recognize squares of split graphs
- On some graph classes related to perfect graphs: a survey
- Recognizing Helly edge-path-tree graphs and their clique graphs
- Balanced matrices
- On hereditary clique-Helly self-clique graphs
- Variations of maximum-clique transversal sets on graphs
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- On neighborhood-Helly graphs
- The complexity of clique graph recognition
- Simplicial and nonsimplicial complete subgraphs
- On irreducibility of maximal cliques
- On minimal forbidden subgraph characterizations of balanced graphs
- Balancedness of some subclasses of circular-arc graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Self‐clique graphs and matrix permutations
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Characterizing flag graphs and incuced subgraphs of Cartesian product graphs
- Transversal partitioning in balanced hypergraphs
- On balanced graphs
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
- Characterization and recognition of generalized clique-Helly graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288086)
