On clique-complete graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 22656 (Why is no real title available?)
- scientific article; zbMATH DE number 553916 (Why is no real title available?)
- scientific article; zbMATH DE number 1409177 (Why is no real title available?)
- A partial characterization of clique graphs
- Clique graphs and Helly graphs
- Clique graphs of time graphs
- Convergence of iterated clique graphs
- On clique convergent graphs
- Über iterierte Clique-Graphen
Cited in
(19)- On the existence of critical clique-Helly graphs
- Split clique graph complexity
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Contractibility and the clique graph operator
- scientific article; zbMATH DE number 4156479 (Why is no real title available?)
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Clique-critical graphs: maximum size and recognition
- On clique convergent graphs
- Clique-perfectness of complements of line graphs
- The complexity of clique graph recognition
- On replete graphs
- Characterization of classical graph classes by weighted clique graphs
- The clique operator on cographs and serial graphs
- Iterated Clique Graphs and Contractibility
- scientific article; zbMATH DE number 2230196 (Why is no real title available?)
- scientific article; zbMATH DE number 1944140 (Why is no real title available?)
- scientific article; zbMATH DE number 5722250 (Why is no real title available?)
- Biclique graphs of split graphs
This page was built for publication: On clique-complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382831)