On hereditary clique-Helly self-clique graphs
From MaRDI portal
Publication:2482111
Recommendations
Cites work
- A characterization of clique graphs
- A hierarchy of self-clique graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- A new characterization of strongly chordal graphs
- A partial characterization of clique graphs
- scientific article; zbMATH DE number 3765821 (Why is no real title available?)
- scientific article; zbMATH DE number 553916 (Why is no real title available?)
- scientific article; zbMATH DE number 1990681 (Why is no real title available?)
- scientific article; zbMATH DE number 3993639 (Why is no real title available?)
- scientific article; zbMATH DE number 3795988 (Why is no real title available?)
- scientific article; zbMATH DE number 2096440 (Why is no real title available?)
- scientific article; zbMATH DE number 1409177 (Why is no real title available?)
- On Graphs Without Multicliqual Edges
- On self-clique graphs with given clique sizes
- Self‐clique graphs and matrix permutations
- Über iterierte Clique-Graphen
Cited in
(10)- The complexity of clique graph recognition
- On self-clique graphs with given clique sizes. II
- A hierarchy of self-clique graphs
- On the clique behavior of graphs of low degree
- Edge contraction and edge removal on iterated clique graphs
- On self-clique shoal graphs
- scientific article; zbMATH DE number 553916 (Why is no real title available?)
- Self‐clique graphs and matrix permutations
- scientific article; zbMATH DE number 1866901 (Why is no real title available?)
- On self-clique graphs with triangular cliques
This page was built for publication: On hereditary clique-Helly self-clique graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482111)