AbstractWe compute the exact maximum number of vertices in a planar graph with diameter two and maximum degree Δ, for any Δ⩾8. Results for larger diameter are also mentioned
AbstractIt is well known that the spectral radius of a tree whose maximum degree is Δ cannot exceed ...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph ...
AbstractWe consider the problem of determining the maximum number of vertices in a planar graph with...
AbstractLet fk(Δ) be the maximum number of vertices in a planar graph with diameter k and maximum de...
AbstractWe offer the exact solution of the degree–diameter problem for planar graphs in the case of ...
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...
In graph theory, the degree diameter problem asks for the maximum number of vertices a graph with gi...
We consider the degree/diameter problem for directed planar graphs. We show that planar digraphs wit...
AbstractThe following problem arises in the study of interconnection networks: find graphs of given ...
A graph is diameter-2-critical if its diameter is two and the deletion of any edge increases the dia...
AbstractIn this paper, we present algorithms that compute large matchings in planar graphs with fixe...
summary:In this paper it is proved that every $3$-connected planar graph contains a path on $3$ vert...
AbstractMacGillivary and Seyffarth [G. MacGillivray, K. Seyffarth, Domination numbers of planar grap...
AbstractIt is well known that the spectral radius of a tree whose maximum degree is Δ cannot exceed ...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph ...
AbstractWe consider the problem of determining the maximum number of vertices in a planar graph with...
AbstractLet fk(Δ) be the maximum number of vertices in a planar graph with diameter k and maximum de...
AbstractWe offer the exact solution of the degree–diameter problem for planar graphs in the case of ...
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...
In graph theory, the degree diameter problem asks for the maximum number of vertices a graph with gi...
We consider the degree/diameter problem for directed planar graphs. We show that planar digraphs wit...
AbstractThe following problem arises in the study of interconnection networks: find graphs of given ...
A graph is diameter-2-critical if its diameter is two and the deletion of any edge increases the dia...
AbstractIn this paper, we present algorithms that compute large matchings in planar graphs with fixe...
summary:In this paper it is proved that every $3$-connected planar graph contains a path on $3$ vert...
AbstractMacGillivary and Seyffarth [G. MacGillivray, K. Seyffarth, Domination numbers of planar grap...
AbstractIt is well known that the spectral radius of a tree whose maximum degree is Δ cannot exceed ...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph ...
DOI
Add to ORKG