Edge Coloring Planar Graphs with Two Outerplanar Subgraphs

dc.contributor.author	Heath, Lenwood S.	en
dc.contributor.department	Computer Science	en
dc.date.accessioned	2013-06-19T14:36:40Z	en
dc.date.available	2013-06-19T14:36:40Z	en
dc.date.issued	1991-12-01	en
dc.description.abstract	The 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.	en
dc.format.mimetype	application/pdf	en
dc.identifier	http://eprints.cs.vt.edu/archive/00000279/	en
dc.identifier.sourceurl	http://eprints.cs.vt.edu/archive/00000279/01/TR-91-34.pdf	en
dc.identifier.trnumber	TR-91-34	en
dc.identifier.uri	http://hdl.handle.net/10919/19716	en
dc.language.iso	en	en
dc.publisher	Department of Computer Science, Virginia Polytechnic Institute & State University	en
dc.relation.ispartof	Historical Collection(Till Dec 2001)	en
dc.rights	In Copyright	en
dc.rights.uri	http://rightsstatements.org/vocab/InC/1.0/	en
dc.title	Edge Coloring Planar Graphs with Two Outerplanar Subgraphs	en
dc.type	Technical report	en
dc.type.dcmitype	Text	en

Files

Now showing 1 - 1 of 1