Add to ORKGA graph is a brick if it is 3-connected and bicritical. A brick is minimal if for every edge, the deletion of it results in a graph that is not a brick. In this article, we prove that every minimal brick has at least four cubic vertices. ? 2013 Wiley Periodicals, Inc
AbstractWe consider the maximum number of vertices in a cubic graph with small diameter. We show tha...
Throughout this paper, G = (V,E) denotes a (δ, g)-graph with vertex set V and edge set E, that is, a...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
AbstractA brick is a 3-connected graph such that the graph obtained from it by deleting any two dist...
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct ver...
AbstractA brick is a 3-connected graph such that the graph obtained from it by deleting any two dist...
A graph is matching covered if it connected, has at least two vertices and each of its edges is cont...
AbstractA graph is matching covered if it connected, has at least two vertices and each of its edges...
We study two measures of nonplanarity of cubic graphs G, the genus γ (G), and the edge deletion numb...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
AbstractA brick is a 3-connected graph such that the graph obtained from it by deleting any two dist...
AbstractWe consider the maximum number of vertices in a cubic graph with small diameter. We show tha...
Throughout this paper, G = (V,E) denotes a (δ, g)-graph with vertex set V and edge set E, that is, a...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
AbstractA brick is a 3-connected graph such that the graph obtained from it by deleting any two dist...
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct ver...
AbstractA brick is a 3-connected graph such that the graph obtained from it by deleting any two dist...
A graph is matching covered if it connected, has at least two vertices and each of its edges is cont...
AbstractA graph is matching covered if it connected, has at least two vertices and each of its edges...
We study two measures of nonplanarity of cubic graphs G, the genus γ (G), and the edge deletion numb...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
AbstractA brick is a 3-connected graph such that the graph obtained from it by deleting any two dist...
AbstractWe consider the maximum number of vertices in a cubic graph with small diameter. We show tha...
Throughout this paper, G = (V,E) denotes a (δ, g)-graph with vertex set V and edge set E, that is, a...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...