Edge-Coloring Partial k -Trees

Author： Zhou X.   Nakano S.I.   Nishizeki T.  

Publisher： Academic Press

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.21, Iss.3, 1996-11, pp. : 598-617

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

Algorithm for the Cost Edge-Coloring of Trees

By Zhou Xiao   Nishizeki Takao  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 97-108

Springer Publishing Company

Access to resources Recommend Favorite

Optimal edge‐coloring with edge rate constraints

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 62, Iss. 3, 2013-10 ,pp. : 165-182

John Wiley & Sons Inc

Access to resources Recommend Favorite

An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs

By Zhou X.   Suzuki H.   Nishizeki T.  

Journal of Algorithms, Vol. 23, Iss. 2, 1997-05 ,pp. : 359-374

Academic Press

Access to resources Recommend Favorite

Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation

By Lee Jon   Leung Janny   Vries Sven  

Journal of Combinatorial Optimization, Vol. 9, Iss. 1, 2005-02 ,pp. : 59-67

Springer Publishing Company

Access to resources Recommend Favorite

The k -coloring fitness landscape

By Bouziri Hend  

Journal of Combinatorial Optimization, Vol. 21, Iss. 3, 2011-04 ,pp. : 306-329

Springer Publishing Company

Access to resources Recommend Favorite