Abstract
For given a graph , a graphic sequence is said to be potentially -graphic if there exists a realization of containing as a subgraph. In this paper, we characterize the potentially -graphic sequences where denotes 3-regular graph with 6 vertices. In other words, we characterize the potentially and -graphic sequences where is an complete bipartite graph. One of these characterizations implies a theorem due to Yin [25].
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.