On potentially 3-regular graph graphic sequences

Abstract: For given a graph

H

, a graphic sequence

p i = (d_{1}, d_{2}, ..., d_{n})

is said to be potentially

H

-graphic if there exists a realization of

p i

containing

H

as a subgraph. In this paper, we characterize the potentially

H

-graphic sequences where

H

denotes 3-regular graph with 6 vertices. In other words, we characterize the potentially

K_{3, 3}

and

K_{6} - C_{6}

-graphic sequences where

K_{r, r}

is an

r i m e s r

complete bipartite graph. One of these characterizations implies a theorem due to Yin [25].

Recommendations

Cited in

(2)

This page was built for publication: On potentially 3-regular graph graphic sequences