Clique divergent graphs with unbounded sequence of diameters
From MaRDI portal
Publication:1292855
DOI10.1016/S0012-365X(99)90105-XzbMATH Open0938.05050MaRDI QIDQ1292855FDOQ1292855
Publication date: 9 August 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4049680
- scientific article; zbMATH DE number 1286517
- On iterated clique graphs with increasing diameters
- Diameters of iterated clique graphs of chordal graphs
- On clique divergent graphs with linear growth
- Clique divergent clockwork graphs and partial orders
- Clique divergent clockwork graphs and partial orders
- A family of clique divergent graphs with linear growth
- Distances and diameters on iterated clique graphs
- Distances and diameters on iterated clique graphs
Cites Work
- Sur le coloriage des graphs
- Über iterierte Clique-Graphen
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel concepts in graph theory
- Title not available (Why is that?)
- Clique graphs and Helly graphs
- Title not available (Why is that?)
- A common generalization of line graphs and clique graphs
- Clique graphs of time graphs
- Title not available (Why is that?)
- Convergence of iterated clique graphs
- On clique-critical graphs
- Title not available (Why is that?)
- Diameters of iterated clique graphs of chordal graphs
- On iterated clique graphs with increasing diameters
- Title not available (Why is that?)
- A family of clique divergent graphs with linear growth
- Squares, clique graphs, and chordality
Cited In (18)
- Clique divergent clockwork graphs and partial orders
- The clique operator on graphs with few \(P_{4}\)'s
- On the iterated edge-biclique operator
- On the clique behavior of circulants with three small jumps
- Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\)
- The clique operator on cographs and serial graphs
- On expansive graphs
- Clique dynamics of locally cyclic graphs with \(\delta \geq 6\)
- On the clique behavior of graphs of low degree
- Distances and diameters on iterated clique graphs
- On the Iterated Biclique Operator
- The clique graphs of the hexagonal lattice -- an explicit construction and a short proof of divergence
- Distances and diameters on iterated clique graphs
- Almost every graph is divergent under the biclique operator
- A new family of expansive graphs
- On the edge‐biclique graph and the iterated edge‐biclique operator
- The icosahedron is clique divergent
- On clique divergent graphs with linear growth
This page was built for publication: Clique divergent graphs with unbounded sequence of diameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292855)
