On Potentially 3-regular graph graphic Sequences

Details On Potentially 3-regular graph graphic Sequences On Potentially 3-regular graph graphic Sequences

2008-01-04

arxiv.org/abs/0801.0658v2

Utilitas Mathematica, 80 (2009), 33 - 51

Mathematics

Combinatorics

19 pages

Scientific paper

For given a graph $H$, a graphic sequence $\pi=(d_1,d_2,...,d_n)$ is said to be potentially $H$-graphic if there exists a realization of $\pi$ 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\times r$ complete bipartite graph. One of these characterizations implies a theorem due to Yin [25].

Affiliated with

Also associated with

No associations

Rating

On Potentially 3-regular graph graphic Sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Potentially 3-regular graph graphic Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Potentially 3-regular graph graphic Sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-379574