DOIAbstract
AbstractWe offer the exact solution of the degree–diameter problem for planar graphs in the case of even diameter 2d and large degree Δ≥6(12d+1). New graph examples are constructed improving the lower bounds for Δ≥5
AbstractWe offer the exact solution of the degree–diameter problem for planar graphs in the case of even diameter 2d and large degree Δ≥6(12d+1). New graph examples are constructed improving the lower bounds for Δ≥5
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
AbstractWe offer the exact solution of the degree–diameter problem for planar graphs in the case of ...
AbstractLet fk(Δ) be the maximum number of vertices in a planar graph with diameter k and maximum de...
The (¿;D) (degree/diameter) problem consists of nding the largest possible number of vertices n amo...
The (A ,D) (degree/diameter) problem consists of finding the largest possible number of vertices n a...
We consider the degree/diameter problem for directed planar graphs. We show that planar digraphs wit...
AbstractWe consider the problem of determining the maximum number of vertices in a planar graph with...
AbstractWe compute the exact maximum number of vertices in a planar graph with diameter two and maxi...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface Σ ...
In graph theory, the degree diameter problem asks for the maximum number of vertices a graph with gi...
The degree-diameter problem asks for the maximum number of vertices in a graph with maximum degree ∆...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
AbstractWe offer the exact solution of the degree–diameter problem for planar graphs in the case of ...
AbstractLet fk(Δ) be the maximum number of vertices in a planar graph with diameter k and maximum de...
The (¿;D) (degree/diameter) problem consists of nding the largest possible number of vertices n amo...
The (A ,D) (degree/diameter) problem consists of finding the largest possible number of vertices n a...
We consider the degree/diameter problem for directed planar graphs. We show that planar digraphs wit...
AbstractWe consider the problem of determining the maximum number of vertices in a planar graph with...
AbstractWe compute the exact maximum number of vertices in a planar graph with diameter two and maxi...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface Σ ...
In graph theory, the degree diameter problem asks for the maximum number of vertices a graph with gi...
The degree-diameter problem asks for the maximum number of vertices in a graph with maximum degree ∆...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
Add to ORKG