Classes of Upper-embeddable Graphs in Terms of Dominate Vertices Set
Huang Yuan-qiu · Journal of Hunan University of Arts and Science · 2007
Combined with the dominate vertices set of graphs and some other conditions, the following results are provn: (1) Let G be a connected loopless graph, if G contains a subgraph W satisfing W is a wheel, and V (W ) = { x , y1, y 2, , yt }(t ≥ 3) is a dominate vertices set of G , then G is upper embeddable. (2) Let G be a connected loopless graph, if G contains a subgraph D satisfing D is a complete bipartite graph, and V ( D )= X ∪ Y is a dominate vertices set of G ( | X |≥ 3, | Y |≥ 4), then G is upper embeddable.