Author： Pelsmajer Michael J.
Publisher： Springer Publishing Company
ISSN： 0911-0119
Source： Graphs and Combinatorics, Vol.20, Iss.1, 2004-03, pp. : 121-129
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
Approximation of pathwidth of outerplanar graphs
Journal of Algorithms, Vol. 43, Iss. 2, 2002-05 ,pp. :
Access to resources
Recommend
By Schietgat Leander Ramon Jan Bruynooghe Maurice
Annals of Mathematics and Artificial Intelligence, Vol. 69, Iss. 4, 2013-12 ,pp. :
A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs
Journal of Algorithms, Vol. 35, Iss. 2, 2000-05 ,pp. :
Maximum Directed Cuts in Graphs with Degree Constraints
By Xu Baogang
Graphs and Combinatorics, Vol. 28, Iss. 4, 2012-07 ,pp. :
Triangulating Planar Graphs While Minimizing the Maximum Degree
Information and Computation, Vol. 135, Iss. 1, 1997-05 ,pp. :