
Graphs with the second and third maximum Wiener index over the 2vertex connected graphs
Wiener index, defined as the sum of distances between all unordered pair...
read it

On the Classification of Motions of Paradoxically Movable Graphs
Edge lengths of a graph are called flexible if there exist infinitely ma...
read it

Cyclebased formulations in Distance Geometry
The distance geometry problem asks to find a realization of a given simp...
read it

A Note On Universal Point Sets for Planar Graphs
We investigate which planar point sets allow simultaneous straightline ...
read it

Planar projections of graphs
We introduce and study a new graph representation where vertices are emb...
read it

Strong HananiTutte for the Torus
If a graph can be drawn on the torus so that every two independent edges...
read it

Flip distances between graph orientations
Flip graphs are a ubiquitous class of graphs, which encode relations ind...
read it
Odd wheels are not odddistance graphs
An odd wheel graph is a graph formed by connecting a new vertex to all vertices of an odd cycle. We answer a question of Rosenfeld and Le by showing that odd wheels cannot be drawn in the plane such that the lengths of the edges are odd integers.
READ FULL TEXT
Comments
There are no comments yet.