Your selections:
A new proof of Balinski's theorem on the connectivity of polytopes
- Pineda-Villavicencio, Guillermo
The linkedness of cubical polytopes: the cube
- Bui, Hoa, Pineda-Villavicencio, Guillermo, Ugon, Julien
Polytopes close to being simple
- Pineda-Villavicencio, Guillermo, Ugon, Julien, Yost, David
On the reconstruction of polytopes
- Doolittle, Joseph, Nevo, Eran, Pineda-Villavicencio, Guillermo, Ugon, Julien, Yost, David
The excess degree of a polytope
- Pineda-Villavicencio, Guillermo, Ugon, Julien, Yost, David
Nonmeasurable subgroups of compact groups
- Hernández, Salvador, Hofmann, Karl, Morris, Sidney
Constructions of large graphs on surfaces
- Feria-Purón, Ramiro, Pineda-Villavicencio, Guillermo
The weights of closed subgroups of a locally compact group
- Hernández, Salvador, Hofmann, Karl, Morris, Sidney
An algorithm for the optimization of multiple classifers in data mining based on graphs
- Kelarev, Andrei, Ryan, Joe, Yearwood, John
On the nonexistence of graphs of diameter 2 and defect 2
- Miller, Mirka, Nguyen, Minh Hoang, Pineda-Villavicencio, Guillermo
New constructions of A-magic graphs using labeling matrices
- Sugeng, Kiki Ariyanti, Miller, Mirka
On antimagic labelings of disjoint union of complete s-partite graphs
- Dafik, Miller, Mirka, Ryan, Joe, Baca, Martin
On graphs of maximum degree 3 and defect 4
- Pineda-Villavicencio, Guillermo, Miller, Mirka
Are you sure you would like to clear your session, including search history and login status?