#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2003

2017

- This year (0)
- Last 5 years (4)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Criel Merino, Steven D. Noble, Marcelino RamÃrez-IbÃ¡Ã±ez, R. Villarroel-Flores
- Eur. J. Comb.
- 2012

We analyze the split exact sequences of (co)homology groups associated to the spaces of Dwyer which give rise to the centralizer decomposition and subgroup decomposition of the classifying space BGâ€¦ (More)

- Francisco LarriÃ³n, Miguel A. PizaÃ±a, R. Villarroel-Flores
- Eur. J. Comb.
- 2008

To any finite poset P we associate two graphs which we denote by Î©(P ) and 0(P ). Several standard constructions can be seen as Î©(P ) or 0(P ) for suitable posets P , including the comparabilityâ€¦ (More)

- Francisco LarriÃ³n, Miguel A. PizaÃ±a, R. Villarroel-Flores
- Discrete Mathematics
- 2013

The clique graph K(G) of a graph G is the intersection graph of all its (maximal) cliques. A graph G is said to be K-divergent if the sequence of orders of its iterated clique graphs |Kn(G)| tends toâ€¦ (More)

- Francisco LarriÃ³n, Miguel A. PizaÃ±a, R. Villarroel-Flores
- Discrete Mathematics
- 2008

To any graph G we can associate a simplicial complex âˆ†(G) whose simplices are the complete subgraphs of G, and thus we say that G is contractible whenever âˆ†(G) is so. We study the relationshipâ€¦ (More)

For C a G-category, we give a condition on a diagram of simplicial sets indexed on C that allows us to define a natural G-action on its homotopy colimit, and in some other simplicial sets andâ€¦ (More)

- Francisco LarriÃ³n, Miguel A. PizaÃ±a, R. Villarroel-Flores
- Discrete Mathematics
- 2008

The clique graph K(G) of a simple graph G is the intersection graph of its maximal complete subgraphs, and we define iterated clique graphs by K(G) = G, K(G) = K(K(G)). We say that two graphs areâ€¦ (More)

- Francisco LarriÃ³n, Miguel A. PizaÃ±a, R. Villarroel-Flores
- Discrete Mathematics
- 2016

Abstract. A graph is an {r, s}-graph if the set of degrees of their vertices is {r, s}. A clique of a graph is a maximal complete subgraph. The clique graph K(G) of a graph G is the intersectionâ€¦ (More)

- Francisco LarriÃ³n, Miguel A. PizaÃ±a, R. Villarroel-Flores
- Eur. J. Comb.
- 2009

Given a finite connected bipartite graph B = (X, Y ) we consider the simplicial complexes of complete subgraphs of the square B of B and of its induced subgraphs B[X] and B[Y ]. We prove that theseâ€¦ (More)

We attach topological concepts to a simple graph by means of the simplicial complex of its complete subgraphs. Using Formanâ€™s discrete Morse theory we show that the strong product of two graphs isâ€¦ (More)