On the number of planar orientations with prescribed degrees.
Felsner, Stefan, Zickfeld, Florian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Isoperimetric numbers and spectral radius of some infinite planar graphs”
On the number of planar orientations with prescribed degrees.
New lower bounds for orthogonal drawings.
Biedl, Therese C. (1998)
Journal of Graph Algorithms and Applications
Similarity:
Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.
Wood, David R. (2003)
Journal of Graph Algorithms and Applications
Similarity:
Geometric thickness of complete graphs.
Dillencourt, Michael B., Eppstein, David, Hirschberg, Daniel S. (2000)
Journal of Graph Algorithms and Applications
Similarity:
Minimax degrees of quasiplane graphs without 4-faces.
Borodin, O.V., Ivanova, A.O., Kostochka, A.V., Sheikh, N.N. (2007)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Planar drawings of higher-genus graphs.
Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2011)
Journal of Graph Algorithms and Applications
Similarity:
Connectivity of planar graphs.
de Fraysseix, Hubert, Ossona de Mendez, Patrice (2001)
Journal of Graph Algorithms and Applications
Similarity:
On the norms of the random walks on planar graphs
Andrzej Żuk (1997)
Annales de l'institut Fourier
Similarity:
We consider the nearest neighbor random walk on planar graphs. For certain families of these graphs, we give explicit upper bounds on the norm of the random walk operator in terms of the minimal number of edges at each vertex. We show that for a wide range of planar graphs the spectral radius of the random walk is less than one.
On polygons and polyhedra
Siniša Vrećica (2005)
The Teaching of Mathematics
Similarity: