Computer Science Technical Reports
CS at VT

Edge Coloring Planar Graphs with Two Outerplanar Subgraphs

Heath, Lenwood S. (1991) Edge Coloring Planar Graphs with Two Outerplanar Subgraphs. Technical Report TR-91-34, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
TR-91-34.pdf (1647540)


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.

Item Type:Departmental Technical Report
Subjects:Computer Science > Historical Collection(Till Dec 2001)
ID Code:279
Deposited By:User autouser
Deposited On:05 December 2001