Publication date
May 2007
DOIAbstract
Let G be a simple graph with diameter four, if G does not contain complete subgraph K3 of order three
Let G be a simple graph with diameter four, if G does not contain complete subgraph K3 of order three
We prove that there is no cubic graph with diameter 4 on 40 vertices. This implies that the maximal ...
AbstractIt is shown that ⌈β(G)/3⌉ is the tight lower bound on the maximum genus γM(G) of 2-edge-conn...
AbstractThe object of this paper is to determine the minimum possible number of edges for a graph of...
Let G be a simple graph with diameter four,if G does not contain complete subgraph K3 of order three
AbstractIn this paper, the lower bounds on the maximum genus of a simple graph in terms of its conne...
AbstractIn this paper, a lower bound on the maximum genus of a graph in terms of its girth is establ...
AbstractThis paper shows that if G is a simple graph with diameter three then G is up-embeddable unl...
AbstractThe maximum genus, γM(G), of a connected graph G is the largest genus γ(S) for orientable su...
AbstractIn this paper, the lower bounds on the maximum genus of a simple graph in terms of its conne...
AbstractLet G be a (finite) graph of diameter two. We prove that if G is loopless then it is upper e...
AbstractIt is proved that every connected simplicial graph with minimum valence at least three has m...
AbstractIn this paper, the lower bounds of maximum genera of simplicial graphs under the constraints...
AbstractThe genus γ(G) of a simple graph G is the minimum genus of the orientable surface on which G...
AbstractWe define the maximum genus, γM(G), of a connected graph G to be the largest genus γ(N) for ...
AbstractWe give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a conne...
We prove that there is no cubic graph with diameter 4 on 40 vertices. This implies that the maximal ...
AbstractIt is shown that ⌈β(G)/3⌉ is the tight lower bound on the maximum genus γM(G) of 2-edge-conn...
AbstractThe object of this paper is to determine the minimum possible number of edges for a graph of...
Let G be a simple graph with diameter four,if G does not contain complete subgraph K3 of order three
AbstractIn this paper, the lower bounds on the maximum genus of a simple graph in terms of its conne...
AbstractIn this paper, a lower bound on the maximum genus of a graph in terms of its girth is establ...
AbstractThis paper shows that if G is a simple graph with diameter three then G is up-embeddable unl...
AbstractThe maximum genus, γM(G), of a connected graph G is the largest genus γ(S) for orientable su...
AbstractIn this paper, the lower bounds on the maximum genus of a simple graph in terms of its conne...
AbstractLet G be a (finite) graph of diameter two. We prove that if G is loopless then it is upper e...
AbstractIt is proved that every connected simplicial graph with minimum valence at least three has m...
AbstractIn this paper, the lower bounds of maximum genera of simplicial graphs under the constraints...
AbstractThe genus γ(G) of a simple graph G is the minimum genus of the orientable surface on which G...
AbstractWe define the maximum genus, γM(G), of a connected graph G to be the largest genus γ(N) for ...
AbstractWe give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a conne...
We prove that there is no cubic graph with diameter 4 on 40 vertices. This implies that the maximal ...
AbstractIt is shown that ⌈β(G)/3⌉ is the tight lower bound on the maximum genus γM(G) of 2-edge-conn...
AbstractThe object of this paper is to determine the minimum possible number of edges for a graph of...
Add to ORKG