Vertex Splitting and Upper Embeddable Graphs

Details Vertex Splitting and Upper Embeddable Graphs Vertex Splitting and Upper Embeddable Graphs

2012-03-05

arxiv.org/abs/1203.0840v1

Mathematics

Combinatorics

Scientific paper

The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of upper embeddable graphs that for each graph G in G, every weak minor of G is also in G. Up to now, there are few results providing the necessary and sufficient conditions for characterizing upper embeddability of graphs. In this paper, we studied the relation between the vertex splitting operation and the upper embeddability of graphs; provided not only a necessary and sufficient condition for characterizing upper embeddability of graphs, but also a way to construct weak-minor-closed family of upper embeddable graphs from the bouquet of circles; extended a result in J: Graph Theory obtained by L. Nebesk{\P}y. In addition, the algorithm complex of determining the upper embeddability of a graph can be reduced much by the results obtained in this paper.

Affiliated with

Also associated with

No associations

Rating

Vertex Splitting and Upper Embeddable Graphs 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 Vertex Splitting and Upper Embeddable Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertex Splitting and Upper Embeddable Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-132615