The clique operator on matching and chessboard graphs
DOI10.1016/J.DISC.2007.12.047zbMATH Open1207.05158OpenAlexW2078297556MaRDI QIDQ998495FDOQ998495
Authors: F. Larrión, M. A. Pizaña, Rafael Villarroel-Flores 
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.047
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Title not available (Why is that?)
- Locally \(C_6\) graphs are clique divergent
- Über iterierte Clique-Graphen
- Title not available (Why is that?)
- Title not available (Why is that?)
- Homology of certain sets of 2-subgroups of symmetric groups
- Topology of matching, chessboard, and general bounded degree graph complexes
- Chessboard Complexes and Matching Complexes
- Combinatorial Laplacian of the matching complex
- Torsion in the matching complex and chessboard complex
- Title not available (Why is that?)
- Title not available (Why is that?)
- The clique operator on cographs and serial graphs
- The colored Tverberg's problem and complexes of injective functions
- Convergence of iterated clique graphs
- Clique divergent clockwork graphs and partial orders
- Hypergraph matching complexes and Quillen complexes of symmetric groups.
- Locally petersen graphs
- Graphs which are locally a cube
- Whitney triangulations, local girth and iterated clique graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- On the clique behavior and Hellyness of the complements of regular graphs
- On the clique behavior of circulants with three small jumps
- On the clique behavior of graphs of low degree
- Matching complexes, bounded degree graph complexes, and weight spaces of \(\mathrm{GL}_n\)-complexes
- Edge contraction and edge removal on iterated clique graphs
- Perfect matching complexes of honeycomb graphs
Uses Software
This page was built for publication: The clique operator on matching and chessboard graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998495)
