Distinct distances in graph drawings.
Drawing 3-polytopes with good vertex resolution.
Drawing a graph in a hypercube.
Drawing clustered graphs on an orthogonal grid.
Drawing graphs on two and three lines.
Drawing graphs within graphs.
Drawing planar graphs with large vertices and thick edges.
Existentially closed BIBD block-intersection graphs.
Geometric simultaneous embeddings of a graph and a matching.
Graph drawing by high-dimensional embedding.
Hamiltonian paths on Platonic graphs.
Hyperbolicity and chordality of a graph.
Jamming and geometric representations of graphs.
Minimum-area drawings of plane 3-trees.
Modular, -noncrossing diagrams.
More canonical ordering.
More flexible radial layout.
Morphing planar graph drawings with bent edges.
Nanonetworks: The graph theory framework for modeling nanoscale systems
Nanonetwork is defined as a mathematical model of nanosize objects with biological, physical and chemical attributes, which are interconnected within certain dynamical process. To demonstrate the potentials of this modeling approach for quantitative study of complexity at nanoscale, in this survey, we consider three kinds of nanonetworks: Genes of a yeast are connected by weighted links corresponding to their coexpression along the cell cycle; Gold nanoparticles, arranged on a substrate, are linked...
New infinite families of almost-planar crossing-critical graphs.