![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Euler R.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.263, Iss.1, 2001-07, pp. : 47-58
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Edge coloring of bipartite graphs with constraints
By Caragiannis I. Kaklamanis C. Persiano P.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
![](/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)
Efficient parallel algorithms for doubly convex-bipartite graphs
Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Domino tiling in planar graphs with regular and bipartite dual
By Chaboud T.
Theoretical Computer Science, Vol. 159, Iss. 1, 1996-05 ,pp. :