The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On potentially K 5 - H -graphic sequences”

On potentially H -graphic sequences

Meng Xiao Yin, Jian Hua Yin (2007)

Czechoslovak Mathematical Journal

Similarity:

For given a graph H , a graphic sequence π = ( d 1 , d 2 , ... , d n ) is said to be potentially H -graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially ( K 5 - e ) -positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K 5 -graphic, where K r is a complete graph on r vertices and K r - e is a graph obtained from K r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition...

Uniformly convex functions II

Wancang Ma, David Minda (1993)

Annales Polonici Mathematici

Similarity:

Recently, A. W. Goodman introduced the class UCV of normalized uniformly convex functions. We present some sharp coefficient bounds for functions f(z) = z + a₂z² + a₃z³ + ... ∈ UCV and their inverses f - 1 ( w ) = w + d ₂ w ² + d ₃ w ³ + . . . . The series expansion for f - 1 ( w ) converges when | w | < ϱ f , where 0 < ϱ f depends on f. The sharp bounds on | a n | and all extremal functions were known for n = 2 and 3; the extremal functions consist of a certain function k ∈ UCV and its rotations. We obtain the sharp bounds on | a n | and all extremal functions for...

Star Coloring of Subcubic Graphs

T. Karthick, C.R. Subramanian (2013)

Discussiones Mathematicae Graph Theory

Similarity:

A star coloring of an undirected graph G is a coloring of the vertices of G such that (i) no two adjacent vertices receive the same color, and (ii) no path on 4 vertices is bi-colored. The star chromatic number of G, χs(G), is the minimum number of colors needed to star color G. In this paper, we show that if a graph G is either non-regular subcubic or cubic with girth at least 6, then χs(G) ≤ 6, and the bound can be realized in linear time.