UNIQUELY PARTITIONABLE PLANAR GRAPHS WITH RESPECT TO PROPERTIES HAVING
Pełen tekst
Powiązane dokumenty
In this paper we first prove that K 2,2,8 is not U3LC graph, and thus as a direct corollary, K 2,2,r (r = 4, 5, 6, 7, 8) are not U3LC graphs, and then the uniquely 3-list
A graph G is outerplanar if it is planar and embeddable into the plane so that all vertices lie on the outer face of the embedding.. Such an embedding is called an outerplanar
We present results when a join of two additive hereditary graph properties in (L a , ⊆) has a finite or infinite family of minimal forbidden subgraphs.. Keywords: hereditary
The lattice of (additive) hereditary properties is discussed in [1] — we use the supremum and infimum of properties in our next result without further discussion.... The
In this paper Gallai’s inequality on the number of edges in critical graphs is generalized for reducible additive induced-hereditary prop- erties of graphs in the following way..
The inner vertex number i(G) of a planar graph G is the minimum number of vertices not belonging to the boundary of the exterior region in any embedding of G in the plane..
The linear arboricity la(G) of a graph G, introduced by Harary [8], is the minimum number k for which G has a k-linear coloring.. So it is equivalent to the following conjecture,
If it is incident with a 3-face, then the other two vertices on the same face must be of degree at least 5 and this implies that v receives at least 2 5 from its incident faces..