A characterization of clique graphs
From MaRDI portal
Publication:2545523
DOI10.1016/0095-8956(71)90070-0zbMath0215.05801OpenAlexW2027383911WikidataQ29397152 ScholiaQ29397152MaRDI QIDQ2545523
J. H. Spencer, Fred S. Roberts
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
Related Items
On the iterated edge-biclique operator, The Helly property on subfamilies of limited size, Faster recognition of clique-Helly and hereditary clique-Helly graphs, On second iterated clique graphs that are also third iterated clique graphs, The Images of the Clique Operator and Its Square are Different, Clique-transversal number of graphs whose clique-graphs are trees, Unnamed Item, A characterization of graphs \(G\) with \(G\cong K^ 2(G)\), The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality, Split clique graph complexity, On the edge‐biclique graph and the iterated edge‐biclique operator, On cliques of Helly Circular-arc Graphs, Random Graphs, Retractions and Clique Graphs, Intersection graph of maximal stars, Diclique digraphs, Almost every graph is divergent under the biclique operator, Unnamed Item, Characterization of classical graph classes by weighted clique graphs, Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium, Edge-clique graphs, Signed intersection graphs, Biclique-Helly graphs, The P versus NP-complete dichotomy of some challenging problems in graph theory, On the Iterated Biclique Operator, On hereditary clique-Helly self-clique graphs, The Helly property and satisfiability of Boolean formulas defined on set families, A bibliography of graph equations, Biclique graphs and biclique matrices, On metric properties of certain clique graphs, Clique-critical graphs: maximum size and recognition, The clique operator on circular-arc graphs, The fundamental group of the clique graph, Self‐clique graphs and matrix permutations, Compact structure for sparse undirected graphs based on a clique graph partition, The complexity of clique graph recognition, Cube intersection concepts in median graphs, Applications of edge coverings by cliques, Unnamed Item, Unnamed Item, Split Clique Graph Complexity, A hierarchy of self-clique graphs, Cliques and extended triangles. A necessary condition for planar clique graphs, The number of convergent graphs under the biclique operator with no twin vertices is finite, The difference between clique graphs and iterated clique graphs, On clique-critical graphs, Biclique graphs of split graphs, Vertex removal in biclique graphs, Clique graphs of time graphs, Clique graphs and Helly graphs, Intersection graphs of maximal hypercubes
Cites Work
