A characterization of clique graphs
From MaRDI portal
Publication:2545523
DOI10.1016/0095-8956(71)90070-0zbMATH Open0215.05801OpenAlexW2027383911WikidataQ29397152 ScholiaQ29397152MaRDI QIDQ2545523FDOQ2545523
Authors: Fred Roberts, Joel Spencer 
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(71)90070-0
Cites Work
Cited In (51)
- Minimal Armstrong databases for cardinality constraints
- 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
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- The Helly property and satisfiability of Boolean formulas defined on set families
- 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
- Signed intersection graphs
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Cliques and extended triangles. A necessary condition for planar clique graphs
- Cube intersection concepts in median 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
- Biclique graphs and biclique matrices
- Clique graphs and Helly graphs
- Title not available (Why is that?)
- Diclique digraphs
- A characterization of graphs \(G\) with \(G\cong K^ 2(G)\)
- Random Graphs, Retractions and Clique Graphs
- On second iterated clique graphs that are also third iterated clique graphs
- Clique graphs of time graphs
- On hereditary clique-Helly self-clique graphs
- 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
- Clique-transversal number of graphs whose clique-graphs are trees
- The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality
- Title not available (Why is that?)
- Almost every graph is divergent under the biclique operator
- Split clique graph complexity
- The difference between clique graphs and iterated clique graphs
- The clique operator on circular-arc graphs
- On the edge‐biclique graph and the iterated edge‐biclique operator
- A bibliography of graph equations
- Clique-critical graphs: maximum size and recognition
- Intersection graph of maximal stars
- Self‐clique graphs and matrix permutations
- Applications of edge coverings by cliques
- 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)
