A partial characterization of clique graphs
From MaRDI portal
Cited in
(42)- Split clique graph complexity
- A characterization of clique graphs
- On the iterated biclique operator
- The clique operator on graphs with few \(P_{4}\)'s
- Recognizing clique graphs of directed edge path graphs
- On the iterated edge-biclique operator
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- Biclique-Helly graphs
- Characterization of classical graph classes by weighted clique graphs
- On cliques of Helly Circular-arc Graphs
- On clique-complete graphs
- The number of convergent graphs under the biclique operator with no twin vertices is finite
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- The clique operator on cographs and serial graphs
- Compact structure for sparse undirected graphs based on a clique graph partition
- A hierarchy of self-clique graphs
- Clique graphs and Helly graphs
- On the hyperbolicity of bipartite graphs and intersection graphs
- Diclique digraphs
- A description of claw-free perfect graphs
- A characterization of graphs G with G K^ 2(G)
- Random Graphs, Retractions and Clique Graphs
- Clique graphs of time graphs
- Iterated Clique Graphs and Contractibility
- On hereditary clique-Helly self-clique graphs
- Edge-clique graphs
- On metric properties of certain clique graphs
- The complexity of clique graph recognition
- Almost every graph is divergent under the biclique operator
- Split clique graph complexity
- The clique operator on circular-arc graphs
- On clique convergence of graphs
- On chordal phylogeny graphs
- Contractibility and the clique graph operator
- A bibliography of graph equations
- On the edge‐biclique graph and the iterated edge‐biclique operator
- Applications of edge coverings by cliques
- Self‐clique graphs and matrix permutations
- Structural properties of biclique graphs and the distance formula
- On balanced graphs
- Biclique graphs of split graphs
- Vertex removal in biclique graphs
This page was built for publication: A partial characterization of clique graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5554165)
