Edge covering pseudo-outerplanar graphs with forests

Details Edge covering pseudo-outerplanar graphs with forests Edge covering pseudo-outerplanar graphs with forests

2011-08-19

arxiv.org/abs/1108.3877v2

Mathematics

Combinatorics

This paper was done in the winter of 2009 and has already been submitted to Discrete Mathematics for 3rd round of peer review

Scientific paper

A graph is called pseudo-outerplanar if each block has an embedding on the plane in such a way that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this paper, we prove that each pseudo-outerplanar graph admits edge decompositions into a linear forest and an outerplanar graph, or a star forest and an outerplanar graph, or two forests and a matching, or $\max\{\Delta(G),4\}$ matchings, or $\max\{\lceil\Delta(G)/2\rceil,3\}$ linear forests. These results generalize some ones on outerplanar graphs and $K_{2,3}$-minor-free graphs, since the class of pseudo-outerplanar graphs is a larger class than the one of $K_{2,3}$-minor-free graphs.

Affiliated with

Also associated with

No associations

Rating

Edge covering pseudo-outerplanar graphs with forests 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 Edge covering pseudo-outerplanar graphs with forests, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge covering pseudo-outerplanar graphs with forests will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-107773