Über iterierte Clique-Graphen
From MaRDI portal
Publication:2562095
DOI10.1007/BF02992818zbMATH Open0266.05116OpenAlexW2002766659MaRDI QIDQ2562095FDOQ2562095
Authors: F. Escalante 
Publication date: 1973
Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02992818
Cites Work
Cited In (60)
- On the iterated biclique operator
- On the clique behavior and Hellyness of the complements of regular graphs
- Clique divergent clockwork graphs and partial orders
- On clique convergent graphs
- The clique operator on graphs with few \(P_{4}\)'s
- On self-clique shoal graphs
- The maximum clique problem
- 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
- NP-hardness of the recognition of coordinated graphs
- Biclique-Helly graphs
- Characterization of classical graph classes by weighted clique graphs
- Discrete Morse theory and the homotopy type of clique graphs
- Posets, clique graphs and their homotopy type
- On clique-complete graphs
- On self-clique graphs with given clique sizes. II
- On the clique behavior of circulants with three small jumps
- Signed intersection graphs
- The clique operator on cographs and serial graphs
- The clique operator on matching and chessboard graphs
- On expansive graphs
- On the clique behavior of graphs of low degree
- A hierarchy of self-clique graphs
- Clique graphs and Helly graphs
- A class of clique-closed graphs
- Edge contraction and edge removal on iterated clique graphs
- Equivariant collapses and the homotopy type of iterated clique graphs
- Two infinite families of critical clique-Helly graphs
- A characterization of graphs \(G\) with \(G\cong K^ 2(G)\)
- Random Graphs, Retractions and Clique Graphs
- Strong homotopy types, nerves and collapses
- Recognizing clique graphs of directed and rooted path graphs
- Clique graphs of time graphs
- On self-clique graphs with triangular cliques
- On hereditary clique-Helly self-clique graphs
- Self-clique Helly circular-arc graphs
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Homology of the line graph and of related graph-valued functions
- A sufficient condition for self-clique graphs
- The complexity of clique graph recognition
- Almost every graph is divergent under the biclique operator
- The maximum number of cliques in dense graphs
- Superextensions and the depth of median graphs
- On strong graph bundles
- Clique‐convergence is undecidable for automatic graphs
- Clique divergent graphs with unbounded sequence of diameters
- A family of clique divergent graphs with linear growth
- The clique operator on circular-arc graphs
- On the edge‐biclique graph and the iterated edge‐biclique operator
- A bibliography of graph equations
- Dismantlings and iterated clique graphs
- Convergence of iterated clique graphs
- Applications of edge coverings by cliques
- Structural properties of biclique graphs and the distance formula
- On balanced graphs
- Collapsibility and homological properties of \(\mathfrak{I}\)-contractible transformations
- Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\)
- Helly groups
This page was built for publication: Über iterierte Clique-Graphen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2562095)
