DOIAbstract
AbstractThe nonorientable genus of K4(n) is shown to satisfy: γ(K4(n))=2(n−1)2 for n ⩾ 3, γ(K4(2))=3, γ(K4(1))=1
AbstractThe nonorientable genus of K4(n) is shown to satisfy: γ(K4(n))=2(n−1)2 for n ⩾ 3, γ(K4(2))=3, γ(K4(1))=1
Let G be a simple graph with diameter four,if G does not contain complete subgraph K3 of order three
Some graph-theoretical tools are used to introduce the concept of regular genus, for every closed, n...
Some graph-theoretical tools are used to introduce the concept of regular genus, for every closed, n...
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 the following formula for the genus of the symmetric quadripartite graph is pr...
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...
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 nonorientable genus of Kl,m,n, where l⩾m⩾n, is...
AbstractA conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorien...
Biggs stated that the Coxeter graph can be embedded in an orientable surface of genus 3. The purpose...
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...
Let G be a simple graph with diameter four, if G does not contain complete subgraph K3 of order thre...
Let G be a simple graph with diameter four,if G does not contain complete subgraph K3 of order three
Some graph-theoretical tools are used to introduce the concept of regular genus, for every closed, n...
Some graph-theoretical tools are used to introduce the concept of regular genus, for every closed, n...
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 the following formula for the genus of the symmetric quadripartite graph is pr...
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...
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 nonorientable genus of Kl,m,n, where l⩾m⩾n, is...
AbstractA conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorien...
Biggs stated that the Coxeter graph can be embedded in an orientable surface of genus 3. The purpose...
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...
Let G be a simple graph with diameter four, if G does not contain complete subgraph K3 of order thre...
Let G be a simple graph with diameter four,if G does not contain complete subgraph K3 of order three
Some graph-theoretical tools are used to introduce the concept of regular genus, for every closed, n...
Some graph-theoretical tools are used to introduce the concept of regular genus, for every closed, n...
Add to ORKG