Edge coloring of bipartite graphs with constraints

Author： Caragiannis I. Kaklamanis C. Persiano P.

Publisher： Elsevier

ISSN： 0304-3975

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

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

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

Characterizing bipartite Toeplitz graphs

By Euler R.

Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. : 47-58

Elsevier

Access to resources Recommend Favorite

Coloring of Double Disk Graphs

By Du Hongwei Jia Xiaohua Li Deying Wu Weili

Journal of Global Optimization, Vol. 28, Iss. 1, 2004-01 ,pp. : 115-119

Springer Publishing Company

Access to resources Recommend Favorite

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

By Brandstadt Andreas Dragan Feodor F. Le Hoang-Oanh Le Van Bang Uehara Ryuhei

Algorithmica, Vol. 47, Iss. 1, 2007-01 ,pp. : 27-51

Springer Publishing Company

Access to resources Recommend Favorite