The complexity of the Hajós calculus for planar graphs

Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki
2010 Theoretical Computer Science  
The planar Hajós calculus is the Hajós calculus with the restriction that all the graphs that appear in the construction (including a final graph) must be planar. We prove that the planar Hajós calculus is polynomially bounded iff the Hajós calculus is polynomially bounded.
doi:10.1016/j.tcs.2009.12.011 fatcat:yttqw24yprbvjbul7hgds2gcra