On Potentially 3-regular graph graphic Sequences

preprint2010arXivOpen access

Abstract

For given a graph HH, a graphic sequence π=(d1,d2,...,dn)π=(d_1,d_2,...,d_n) is said to be potentially HH-graphic if there exists a realization of ππ containing HH as a subgraph. In this paper, we characterize the potentially HH-graphic sequences where HH denotes 3-regular graph with 6 vertices. In other words, we characterize the potentially K3,3K_{3,3} and K6−C6K_6-C_6-graphic sequences where Kr,rK_{r,r} is an r×rr\times r complete bipartite graph. One of these characterizations implies a theorem due to Yin [25].

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.