![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Hong Seok-Hee Nagamochi Hiroshi
Publisher: Springer Publishing Company
ISSN: 0178-4617
Source: Algorithmica, Vol.62, Iss.3-4, 2012-04, pp. : 1122-1158
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
New Linear-Time Algorithms for Edge-Coloring Planar Graphs
By Cole Richard Kowalik Łukasz
Algorithmica, Vol. 50, Iss. 3, 2008-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
A linear-time recognition algorithm for P 4 -reducible graphs
By M. Nivat Jamison B. Olariu S.
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :