It follows from the work of Tait and the Four-Color-Theorem that a planar cubic graph is 3-edgecolorable if and only if it contains no bridge. We consider the question of which planar graphs are subgraphs of planar cubic bridgeless graphs, and hence 3-edge-colorable. We provide an efficient recognition algorithm that given an n-vertex planar graph, augments this graph in O(n 2 ) steps to a planar cubic bridgeless supergraph, or decides that no such augmentation is possible. The main tools involve the Generalized Factor-problem for the fixed embedding case, and SPQR-trees for the variable embedding case.
ACM Subject ClassificationTheory of computation → Design and analysis of algorithms → Graph algorithms analysis
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.