Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs

Author： Kral' D.   Voss H.-J.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.295, Iss.1, 2003-02, pp. : 263-278

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems

By Liang W.   Shen X.   Hu Q.  

Journal of Parallel and Distributed Computing, Vol. 32, Iss. 1, 1996-01 ,pp. : 66-73

Academic Press

Access to resources Recommend Favorite

Fractional Path Coloring in Bounded Degree Trees with Applications

By Caragiannis I.   Ferreira A.   Kaklamanis C.   Pérennes S.   Rivano H.  

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 516-540

Springer Publishing Company

Access to resources Recommend Favorite

Sum Coloring of Bipartite Graphs with Bounded Degree

By Malafiejski Michal   Giaro Krzysztof   Janczewski Robert   Kubale Marek  

Algorithmica, Vol. 40, Iss. 4, 2004-09 ,pp. : 235-244

Springer Publishing Company

Access to resources Recommend Favorite

New Linear-Time Algorithms for Edge-Coloring Planar Graphs

By Cole Richard   Kowalik Łukasz  

Algorithmica, Vol. 50, Iss. 3, 2008-03 ,pp. : 351-368

Springer Publishing Company

Access to resources Recommend Favorite

Edge coloring of bipartite graphs with constraints

By Caragiannis I.   Kaklamanis C.   Persiano P.  

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 361-399

Elsevier

Access to resources Recommend Favorite