A characterization of clique graphs
From MaRDI portal
Publication:2545523
Cites work
Cited in
(53)- Split clique graph complexity
- On the iterated biclique operator
- The Helly property on subfamilies of limited size
- The images of the clique operator and its square are different
- On the iterated edge-biclique operator
- On clique-critical graphs
- The Helly property and satisfiability of Boolean formulas defined on set families
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- Clique planar graphs
- Biclique-Helly graphs
- Characterization of classical graph classes by weighted clique graphs
- On cliques of Helly Circular-arc 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
- Signed intersection graphs
- Cube intersection concepts in median graphs
- Cliques and extended triangles. A necessary condition for planar clique graphs
- Compact structure for sparse undirected graphs based on a clique graph partition
- The fundamental group of the clique graph
- A hierarchy of self-clique graphs
- Clique graphs and Helly graphs
- Biclique graphs and biclique matrices
- scientific article; zbMATH DE number 2230196 (Why is no real title available?)
- Diclique digraphs
- A characterization of graphs G with G K^ 2(G)
- On second iterated clique graphs that are also third iterated clique graphs
- Random Graphs, Retractions and Clique Graphs
- Clique graphs of time graphs
- On hereditary clique-Helly self-clique graphs
- Minimal Armstrong databases for cardinality constraints
- Two-player competitive diffusion game: graph classes and the existence of a Nash equilibrium
- Edge-clique graphs
- On metric properties of certain clique graphs
- The complexity of clique graph recognition
- The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality
- Almost every graph is divergent under the biclique operator
- Clique-transversal number of graphs whose clique-graphs are trees
- scientific article; zbMATH DE number 2230239 (Why is no real title available?)
- Split clique graph complexity
- The difference between clique graphs and iterated clique graphs
- The clique operator on circular-arc graphs
- A bibliography of graph equations
- Clique-critical graphs: maximum size and recognition
- On the edge‐biclique graph and the iterated edge‐biclique operator
- A classification of graphs through quadratic embedding constants and clique graph insights
- Line digraphs of polytrees
- Intersection graph of maximal stars
- Applications of edge coverings by cliques
- Self‐clique graphs and matrix permutations
- Structural properties of biclique graphs and the distance formula
- Biclique graphs of split graphs
- Vertex removal in biclique graphs
- Intersection graphs of maximal hypercubes
This page was built for publication: A characterization of clique graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2545523)
