Pages that link to "Item:Q2545523"

The following pages link to A characterization of clique graphs (Q2545523):

Displaying 50 items.

• On second iterated clique graphs that are also third iterated clique graphs (Q324827) (← links)
• Split clique graph complexity (Q393107) (← links)
• Applications of edge coverings by cliques (Q762498) (← links)
• Clique graphs of time graphs (Q798677) (← links)
• Clique graphs and Helly graphs (Q802632) (← links)
• The Helly property on subfamilies of limited size (Q834991) (← links)
• Almost every graph is divergent under the biclique operator (Q908300) (← links)
• The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
• The clique operator on circular-arc graphs (Q987670) (← links)
• The complexity of clique graph recognition (Q1019185) (← links)
• Cube intersection concepts in median graphs (Q1025912) (← links)
• Edge-clique graphs (Q1180434) (← links)
• On metric properties of certain clique graphs (Q1229892) (← links)
• The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
• A hierarchy of self-clique graphs (Q1827744) (← links)
• Cliques and extended triangles. A necessary condition for planar clique graphs (Q1827850) (← links)
• On clique-critical graphs (Q1846435) (← links)
• Intersection graphs of maximal hypercubes (Q1867285) (← links)
• A characterization of graphs \(G\) with \(G\cong K^ 2(G)\) (Q1916378) (← links)
• Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100) (← links)
• Biclique graphs of split graphs (Q2091808) (← links)
• Vertex removal in biclique graphs (Q2091812) (← links)
• On the iterated edge-biclique operator (Q2132393) (← links)
• The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality (Q2172410) (← links)
• Intersection graph of maximal stars (Q2197473) (← links)
• Faster recognition of clique-Helly and hereditary clique-Helly graphs (Q2379939) (← links)
• Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
• Biclique-Helly graphs (Q2478166) (← links)
• On hereditary clique-Helly self-clique graphs (Q2482111) (← links)
• Clique-critical graphs: maximum size and recognition (Q2500528) (← links)
• The fundamental group of the clique graph (Q2519813) (← links)
• (Q2741486) (← links)
• The number of convergent graphs under the biclique operator with no twin vertices is finite (Q2840544) (← links)
• The difference between clique graphs and iterated clique graphs (Q2840680) (← links)
• The Images of the Clique Operator and Its Square are Different (Q2922215) (← links)
• Signed intersection graphs (Q3008563) (← links)
• Split Clique Graph Complexity (Q3104760) (← links)
• Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium (Q3297794) (← links)
• On cliques of Helly Circular-arc Graphs (Q3503539) (← links)
• Random Graphs, Retractions and Clique Graphs (Q3503566) (← links)
• A bibliography of graph equations (Q3856811) (← links)
• Self‐clique graphs and matrix permutations (Q4446891) (← links)
• On the Iterated Biclique Operator (Q4920658) (← links)
• (Q5026980) (← links)
• Biclique graphs and biclique matrices (Q5189236) (← links)
• Clique-transversal number of graphs whose clique-graphs are trees (Q5320228) (← links)
• (Q5708479) (← links)
• (Q5708531) (← links)
• On the edge‐biclique graph and the iterated edge‐biclique operator (Q6081559) (← links)
• Diclique digraphs (Q6180580) (← links)