AbstractKm,n is the complete bipartite graph with m and n vertices in its chromatic classes. G. Ringel has proved that the orientable genus of Km,n is equal to {(m − 2)(n − 2)4} if m ≥ 2 and n ≥ 2 and that its nonorientable genus is equal to {(m − 2)(n − 2)2} if m ≥ 3 and n ≥ 3. We give new proofs of these results
AbstractThe nonorientable genus of K4(n) is shown to satisfy: γ(K4(n))=2(n−1)2 for n ⩾ 3, γ(K4(2))=3...
AbstractIn this paper we compute the orientable genus of the line graph of a graph G, when G is a tr...
AbstractA graph G with at least 2n+2 vertices is said to be n-extendable if every matching of size n...
AbstractKm,n is the complete bipartite graph with m and n vertices in its chromatic classes. G. Ring...
AbstractIn an earlier paper the authors showed that with one exception the nonorientable genus of th...
AbstractThe genus of the complete tripartite graph Kmn,n,n is shown to be (mn−2)(n−1)/2, for all nat...
AbstractIn 1976, Stahl and White conjectured that the nonorientable genus of Kl,m,n, where l⩾m⩾n, is...
AbstractIn 1976, Stahl and White conjectured that the minimum nonorientable genus of Kl,m,n (where l...
AbstractA conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorien...
AbstractWe prove that for every n,m≥6, the complete bipartite graph Kn,m has at least 18nm2⌊(n−1)/3⌋...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractThe Heawood map coloring conjecture for orientable 2-manifolds is one of the oldest unsolved...
AbstractWe prove that for every n,m≥6, the complete bipartite graph Kn,m has at least 18nm2⌊(n−1)/3⌋...
AbstractIn earlier works, additivity theorems for the genus and Euler genus of unions of graphs at t...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractThe nonorientable genus of K4(n) is shown to satisfy: γ(K4(n))=2(n−1)2 for n ⩾ 3, γ(K4(2))=3...
AbstractIn this paper we compute the orientable genus of the line graph of a graph G, when G is a tr...
AbstractA graph G with at least 2n+2 vertices is said to be n-extendable if every matching of size n...
AbstractKm,n is the complete bipartite graph with m and n vertices in its chromatic classes. G. Ring...
AbstractIn an earlier paper the authors showed that with one exception the nonorientable genus of th...
AbstractThe genus of the complete tripartite graph Kmn,n,n is shown to be (mn−2)(n−1)/2, for all nat...
AbstractIn 1976, Stahl and White conjectured that the nonorientable genus of Kl,m,n, where l⩾m⩾n, is...
AbstractIn 1976, Stahl and White conjectured that the minimum nonorientable genus of Kl,m,n (where l...
AbstractA conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorien...
AbstractWe prove that for every n,m≥6, the complete bipartite graph Kn,m has at least 18nm2⌊(n−1)/3⌋...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractThe Heawood map coloring conjecture for orientable 2-manifolds is one of the oldest unsolved...
AbstractWe prove that for every n,m≥6, the complete bipartite graph Kn,m has at least 18nm2⌊(n−1)/3⌋...
AbstractIn earlier works, additivity theorems for the genus and Euler genus of unions of graphs at t...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
AbstractThe nonorientable genus of K4(n) is shown to satisfy: γ(K4(n))=2(n−1)2 for n ⩾ 3, γ(K4(2))=3...
AbstractIn this paper we compute the orientable genus of the line graph of a graph G, when G is a tr...
AbstractA graph G with at least 2n+2 vertices is said to be n-extendable if every matching of size n...
DOI
Add to ORKG