Clique divergent clockwork graphs and partial orders

DOI10.1016/S0166-218X(03)00378-0zbMath1042.05072MaRDI QIDQ1827862

F. Larrión, Miguel A. Pizaña, Víctor Neumann-Lara

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Fixed point propertyClique divergenceIterated clique graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (12)

Clique‐convergence is undecidable for automatic graphs ⋮ Iterated Clique Graphs and Contractibility ⋮ Diclique digraphs ⋮ Edge contraction and edge removal on iterated clique graphs ⋮ Equivariant collapses and the homotopy type of iterated clique graphs ⋮ Contractibility and the clique graph operator ⋮ On the termination of some biclique operators on multipartite graphs ⋮ The clique operator on matching and chessboard graphs ⋮ Termination of the iterated strong-factor operator on multipartite graphs ⋮ A hierarchy of self-clique graphs ⋮ Dismantlings and iterated clique graphs ⋮ On the clique behavior of circulants with three small jumps

Uses Software

• GAP

Cites Work

• Convergence of iterated clique graphs
• A fixed point theorem for finite partially orderes sets
• The fixed point property for small sets
• Clique divergent graphs with unbounded sequence of diameters
• Fixed point property for 11-element sets
• On clique divergent graphs with linear growth
• Fixed points of posets and clique graphs
• Whitney triangulations, local girth and iterated clique graphs
• The icosahedron is clique divergent
• Locally \(C_6\) graphs are clique divergent
• Über iterierte Clique-Graphen
• A lattice-theoretical fixpoint theorem and its applications
• A characterization of complete lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Clique divergent clockwork graphs and partial orders