Author： Kaplan Haim Nussbaum Yahav
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.61, Iss.1, 2011-09, pp. : 174-189
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
L ( p , q )-Labeling and Integer Flow on Planar Graphs
By Zhang Xiaoling Qian Jianguo
Computer Journal, Vol. 56, Iss. 6, 2013-06 ,pp. :
Access to resources
Recommend
Obtaining a Planar Graph by Vertex Deletion
By Marx Dániel Schlotter Ildikó
Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. :
Disk Embeddings of Planar Graphs
Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. :
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
By Shapira Asaf Yuster Raphael Zwick Uri
Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. :
The monadic second-order logic of graphs XII: planar graphs and planar maps
By Courcelle B.
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :