Minimum Color Sum of Bipartite Graphs

Author： Bar-Noy A.   Kortsarz G.  

Publisher： Academic Press

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.28, Iss.2, 1998-08, pp. : 339-365

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

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs

By Panda B.   Pradhan D.  

Journal of Combinatorial Optimization, Vol. 26, Iss. 4, 2013-11 ,pp. : 770-785

Springer Publishing Company

Access to resources Recommend Favorite

On the Decomposition of Graphs into Complete Bipartite Graphs

By Dong Jinquan   Liu Yanpei  

Graphs and Combinatorics, Vol. 23, Iss. 3, 2007-06 ,pp. : 255-262

Springer Publishing Company

Access to resources Recommend Favorite

Domination in Bipartite Graphs and in Their Complements

By Zelinka Bohdan  

Czechoslovak Mathematical Journal, Vol. 53, Iss. 2, 2003-06 ,pp. : 241-247

Springer Publishing Company

Access to resources Recommend Favorite

Decomposition of bipartite graphs into closed trails

By Cichacz Sylwia  

Czechoslovak Mathematical Journal, Vol. 59, Iss. 1, 2009-03 ,pp. : 129-144

Springer Publishing Company

Access to resources Recommend Favorite

Chaotic Numbers of Complete Bipartite Graphs and Tripartite Graphs

By Chiang N.  

Journal of Optimization Theory and Applications, Vol. 131, Iss. 3, 2006-12 ,pp. : 485-491

Springer Publishing Company

Access to resources Recommend Favorite