Heath, Lenwood S.2013-06-192013-06-191991-12-01http://hdl.handle.net/10919/19716The standard problem of edge coloring a graph with k colors is equivalent to partitioning the edge set of the graph into k matchings. Here edge coloring is generalized by replacing matchings with outerplanar graphs. We give a polynomial-time algorithm that edge colors any planar graph with two outerplanar subgraphs. Two is clearly minimal for the class of planar graphs.application/pdfenIn CopyrightTechnical reportTR-91-34http://eprints.cs.vt.edu/archive/00000279/01/TR-91-34.pdf