A partial characterization of clique graphs

From MaRDI portal
Publication:5554165

DOI10.1016/S0021-9800(68)80055-9zbMath0167.22203MaRDI QIDQ5554165

R. C. Hamelink

Publication date: 1968

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)




Related Items

On the iterated edge-biclique operator, Faster recognition of clique-Helly and hereditary clique-Helly graphs, On the hyperbolicity of bipartite graphs and intersection graphs, A characterization of graphs \(G\) with \(G\cong K^ 2(G)\), On clique-complete graphs, Split clique graph complexity, On the edge‐biclique graph and the iterated edge‐biclique operator, On cliques of Helly Circular-arc Graphs, Iterated Clique Graphs and Contractibility, Random Graphs, Retractions and Clique Graphs, Diclique digraphs, Almost every graph is divergent under the biclique operator, Unnamed Item, Characterization of classical graph classes by weighted clique graphs, Contractibility and the clique graph operator, Edge-clique graphs, On clique convergence of 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 clique operator on graphs with few \(P_{4}\)'s, A bibliography of graph equations, On metric properties of certain clique graphs, The clique operator on circular-arc graphs, On chordal phylogeny graphs, Self‐clique graphs and matrix permutations, Compact structure for sparse undirected graphs based on a clique graph partition, The complexity of clique graph recognition, A characterization of clique graphs, Applications of edge coverings by cliques, Split Clique Graph Complexity, The clique operator on cographs and serial graphs, A hierarchy of self-clique graphs, The number of convergent graphs under the biclique operator with no twin vertices is finite, Biclique graphs of split graphs, Vertex removal in biclique graphs, A description of claw-free perfect graphs, Clique graphs of time graphs, On balanced graphs, Clique graphs and Helly graphs, Recognizing clique graphs of directed edge path graphs