92 citations
- J. Morais2 profiles7 · h 16
- R. M. Porter2 profiles7 · h 8
- R. Ortega6 · h 86
- L. Nieto-Barajas5 · h 15
- Mike Behrisch2 profiles5 · h 10
- E. Vargas-García4 · h 3
- H. Lomelí4 · h 12
- J. Fernández-Durán4 · h 7
- M. M. Gregorio-Domínguez4 · h 5
- A. Bobtsov2 profiles3 · h 34
- Benjam'in A. Itz'a-Ortiz2 profiles3 · h 3
- D. Fernández-Duque3 · h 17
- Centro de Investigación y de Estudios Avanzados del Instituto Politécnico NacionalMX7 papers
- TU WienAT5 papers
- Universidad Nacional Autónoma de MéxicoMX5 papers
- Universidad Autónoma del Estado de HidalgoMX4 papers
- California Institute of TechnologyUS3 papers
- Hirosaki UniversityJP3 papers
- Pennsylvania State UniversityUS3 papers
- The University of SydneyAU3 papers
- Universidad Autónoma MetropolitanaMX3 papers
- Universitat Politècnica de CatalunyaES3 papers
- University of Colorado BoulderUS3 papers
- Center for Engineering and Industrial DevelopmentMX2 papers
4 papers · 1 filter
Partitions of complete twisted graphs into plane spanning trees
Ana Paulina Figueroa, Eduardo Rivera-Campo
We characterize all partitions of the complete twisted graph into plane spanning trees. In the case of partitions of into isomorphic plane spanning trees, we show…
Arrow Relations in Lattices of Integer Partitions
Asma'a Almazaydeh, Mike Behrisch, Edith Vargas-García +1
We give a complete characterisation of the single and double arrow relations of the standard context of the lattice of partitions of any positive integer under t…
Representing partition lattices through FCA
Mike Behrisch, Alain Chavarri Villarello, Edith Vargas-García
We investigate the standard context, denoted by , of the lattice of partitions of a positive integer under the dominan…
A counterexample to a result on the tree graph of a graph
Ana Paulina Figueroa, Eduardo Rivera-Campo
Given a set of cycles C of a graph G, the tree graph of G defined by C is the graph T(G,C) whose vertices are the spanning trees of G and in which two trees R and S are adjacent if…