Guillermo Pineda-Villavicencio

Discret. Math., March, 2024

2023

Edge connectivity of simplicial polytopes.

[BibT_eX]

[DOI]

Vincent Pilaud

Eur. J. Comb., October, 2023

2022

The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2022

Reconstructibility of Matroid Polytopes.

[BibT_eX]

[DOI]

Benjamin Schröter

SIAM J. Discret. Math., 2022

Minimum Number of Edges of Polytopes with $2d+2$ Vertices.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Linkedness of Cartesian products of complete graphs.

[BibT_eX]

[DOI]

Leif K. Jørgensen

Ars Math. Contemp., 2022

2021

A new proof of Balinski's theorem on the connectivity of polytopes.

[BibT_eX]

[DOI]

Discret. Math., 2021

The Linkedness of Cubical Polytopes: The Cube.

[BibT_eX]

[DOI]

Hoa T. Bui

Electron. J. Comb., 2021

2020

Connectivity of cubical polytopes.

[BibT_eX]

[DOI]

Hoa T. Bui

J. Comb. Theory, Ser. A, 2020

Using radar plots for performance benchmarking at patient and hospital levels using an Australian orthopaedics dataset.

[BibT_eX]

[DOI]

Daniel M. Morales-Silva

Cameron S. McPherson

Rory Atchison

Health Informatics J., 2020

Polytopes Close to Being Simple.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

2019

Lower bound theorems for general polytopes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

On the Reconstruction of Polytopes.

[BibT_eX]

[DOI]

Joseph Doolittle

Eran Nevo

Discret. Comput. Geom., 2019

2018

The Excess Degree of a Polytope.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

2016

On the maximum order of graphs embedded in surfaces.

[BibT_eX]

[DOI]

Eran Nevo

David R. Wood

J. Comb. Theory, Ser. B, 2016

2015

Quadratic Form Representations via Generalized Continuants.

[BibT_eX]

[DOI]

J. Integer Seq., 2015

Continuants and Some Decompositions Into Squares.

[BibT_eX]

[DOI]

Integers, 2015

The Degree-Diameter Problem for Sparse Graph Classes.

[BibT_eX]

[DOI]

David R. Wood

Electron. J. Comb., 2015

2014

Constructions of Large Graphs on Surfaces.

[BibT_eX]

[DOI]

Graphs Comb., 2014

2013

On large bipartite graphs of diameter 3.

[BibT_eX]

[DOI]

Discret. Math., 2013

Fitting Voronoi Diagrams to Planar Tesselations.

[BibT_eX]

[DOI]

Greg Aloupis

Dannier Trinchet-Almaguer

Perouz Taslakian

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

The Maximum Degree & Diameter-Bounded Subgraph and its Applications.

[BibT_eX]

[DOI]

Anthony Dekker

Paul A. Watters

J. Math. Model. Algorithms, 2012

On bipartite graphs of defect at most 4.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

On graphs of defect at most 2.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

On Graphs with Cyclic Defect or Excess.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

New Benchmarks for Large-Scale Networks with Given Maximum Degree and Diameter.

[BibT_eX]

[DOI]

Eyal Loz

Comput. J., 2010

2009

New largest known graphs of diameter 6.

[BibT_eX]

[DOI]

José Gómez

Networks, 2009

On bipartite graphs of diameter 3 and defect 2.

[BibT_eX]

[DOI]

Leif K. Jørgensen

J. Graph Theory, 2009

On bipartite graphs of defect 2.

[BibT_eX]

[DOI]

Leif K. Jørgensen

Eur. J. Comb., 2009

Complete catalogue of graphs of maximum degree 3 and defect at most 4.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2.

[BibT_eX]

[DOI]

Minh Hoang Nguyen

Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

2006

New Largest Graphs of Diameter 6: (Extended Abstract).

[BibT_eX]

[DOI]

José Gómez