Publication date
November 1969
DOI Publisher
Published by Elsevier Inc. ISSN
0021-9800Abstract
AbstractThe genus of the complete tripartite graph Kmn,n,n is shown to be (mn−2)(n−1)/2, for all natural numbers m and n
AbstractThe genus of the complete tripartite graph Kmn,n,n is shown to be (mn−2)(n−1)/2, for all natural numbers m and n
The set of orientable imbeddings of a graph can be partitioned according to the genus of the imbeddi...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractIn this paper the following formula for the genus of the symmetric quadripartite graph is pr...
AbstractKm,n is the complete bipartite graph with m and n vertices in its chromatic classes. G. Ring...
AbstractIn 1976, Stahl and White conjectured that the nonorientable genus of Kl,m,n, where l⩾m⩾n, is...
AbstractKm,n is the complete bipartite graph with m and n vertices in its chromatic classes. G. Ring...
AbstractIn 1976, Stahl and White conjectured that the minimum nonorientable genus of Kl,m,n (where l...
AbstractIn 1976, Stahl and White conjectured that the minimum nonorientable genus of Kl,m,n (where l...
AbstractIn an earlier paper the authors showed that with one exception the nonorientable genus of th...
AbstractThe Heawood map coloring conjecture for orientable 2-manifolds is one of the oldest unsolved...
AbstractIn this paper the following formula for the genus of the symmetric quadripartite graph is pr...
AbstractWe define the maximum genus, γM(G), of a connected graph G to be the largest genus γ(N) for ...
The problem of determining the genus for a graph can be dated to the Map Color Conjecture proposed b...
AbstractA cyclic construction is presented for building embeddings of the complete tripartite graph ...
AbstractIn 1976, Stahl and White conjectured that the nonorientable genus of Kl,m,n, where l⩾m⩾n, is...
The set of orientable imbeddings of a graph can be partitioned according to the genus of the imbeddi...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractIn this paper the following formula for the genus of the symmetric quadripartite graph is pr...
AbstractKm,n is the complete bipartite graph with m and n vertices in its chromatic classes. G. Ring...
AbstractIn 1976, Stahl and White conjectured that the nonorientable genus of Kl,m,n, where l⩾m⩾n, is...
AbstractKm,n is the complete bipartite graph with m and n vertices in its chromatic classes. G. Ring...
AbstractIn 1976, Stahl and White conjectured that the minimum nonorientable genus of Kl,m,n (where l...
AbstractIn 1976, Stahl and White conjectured that the minimum nonorientable genus of Kl,m,n (where l...
AbstractIn an earlier paper the authors showed that with one exception the nonorientable genus of th...
AbstractThe Heawood map coloring conjecture for orientable 2-manifolds is one of the oldest unsolved...
AbstractIn this paper the following formula for the genus of the symmetric quadripartite graph is pr...
AbstractWe define the maximum genus, γM(G), of a connected graph G to be the largest genus γ(N) for ...
The problem of determining the genus for a graph can be dated to the Map Color Conjecture proposed b...
AbstractA cyclic construction is presented for building embeddings of the complete tripartite graph ...
AbstractIn 1976, Stahl and White conjectured that the nonorientable genus of Kl,m,n, where l⩾m⩾n, is...
The set of orientable imbeddings of a graph can be partitioned according to the genus of the imbeddi...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractIn this paper the following formula for the genus of the symmetric quadripartite graph is pr...
Add to ORKG