Add to ORKGWe prove that for every surface Σ of Euler genus g, every edgemaximal embedding of a graph in Σ is at most O(g) edges short of a triangulation of Σ. This provides the first answer to an open problem of Kainen (1974)
AbstractLet χ1(S) be the maximum chromatic number for all graphs which can be drawn on a surface S s...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
In this paper, by applying the discharging method, we give simple proofs that (1) every n-vertex gra...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
AbstractA signed graph is a graph in which each edge is labelled with a sign. A cycle C of a signed ...
AbstractThis paper studies the following question: given a surface Σ and an integer n, what is the m...
Abstract. The maximum number of vertices in a graph of maximum degree ∆ ≥ 3 and fixed diameter k ≥ ...
An m-covering of a graph G is a spanning subgraph of G with maximum degree at most m. In this paper,...
This paper studies the following question: given a surface σ and an integer n, what is the maximum n...
This paper studies the following question: given a surface σ and an integer n, what is the maximum n...
AbstractThere are two main theorems stated in the introduction section. Theorem A gives upper bounds...
AbstractWhitney's theorem states that 3-connected planar graphs admit essentially unique embeddings ...
AbstractA relative embedding of a graph in a surface with respect to a set of closed walks is one wh...
AbstractA relative embedding of a graph in a surface with respect to a set of closed walks is one wh...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
AbstractLet χ1(S) be the maximum chromatic number for all graphs which can be drawn on a surface S s...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
In this paper, by applying the discharging method, we give simple proofs that (1) every n-vertex gra...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
AbstractA signed graph is a graph in which each edge is labelled with a sign. A cycle C of a signed ...
AbstractThis paper studies the following question: given a surface Σ and an integer n, what is the m...
Abstract. The maximum number of vertices in a graph of maximum degree ∆ ≥ 3 and fixed diameter k ≥ ...
An m-covering of a graph G is a spanning subgraph of G with maximum degree at most m. In this paper,...
This paper studies the following question: given a surface σ and an integer n, what is the maximum n...
This paper studies the following question: given a surface σ and an integer n, what is the maximum n...
AbstractThere are two main theorems stated in the introduction section. Theorem A gives upper bounds...
AbstractWhitney's theorem states that 3-connected planar graphs admit essentially unique embeddings ...
AbstractA relative embedding of a graph in a surface with respect to a set of closed walks is one wh...
AbstractA relative embedding of a graph in a surface with respect to a set of closed walks is one wh...
In this paper, we consider the problem of determining the maximum of the set of maximum degrees of c...
AbstractLet χ1(S) be the maximum chromatic number for all graphs which can be drawn on a surface S s...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
In this paper, by applying the discharging method, we give simple proofs that (1) every n-vertex gra...