|
Fundamentalnaya i Prikladnaya Matematika, 2001, Volume 7, Issue 1, Pages 159–171
(Mi fpm557)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Maximum size of a planar graph ($\Delta=3$, $D=3$)
S. A. Tishchenko School 2
Abstract:
The problem of maximum size of a graph of diameter 3 and maximum degree 3 as a function of its Euler characteristics is studied. The negative solution of an Erdös problem is obtained. A new approach to such problems is proposed which consists in counting the paths between different pairs of vertices in a graph.
Received: 01.04.1999
Citation:
S. A. Tishchenko, “Maximum size of a planar graph ($\Delta=3$, $D=3$)”, Fundam. Prikl. Mat., 7:1 (2001), 159–171
Linking options:
https://www.mathnet.ru/eng/fpm557 https://www.mathnet.ru/eng/fpm/v7/i1/p159
|
Statistics & downloads: |
Abstract page: | 463 | Full-text PDF : | 196 | First page: | 2 |
|