Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
- 1 January 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 7 (1), 131-136
- https://doi.org/10.1137/0607016
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Improving the performance guarantee for approximate graph coloringJournal of the ACM, 1983
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982
- Algorithms for Edge Coloring Bipartite Graphs and MultigraphsSIAM Journal on Computing, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Minimum dominating cycles in outerplanar graphsInternational Journal of Parallel Programming, 1981
- Linear algorithms for edge-coloring trees and unicyclic graphsInformation Processing Letters, 1979
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977
- On the chromatic index of outerplanar graphsJournal of Combinatorial Theory, Series B, 1975
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969