Decomposition of bipartite graphs into closed trails

ISSN： 0011-4642

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

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

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

Decomposing complete tripartite graphs into closed trails of arbitrary lengths

By Billington Elizabeth Cavenagh Nicholas

Czechoslovak Mathematical Journal, Vol. 57, Iss. 2, 2007-06 ,pp. : 523-551

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

Minimum Color Sum of Bipartite Graphs

By Bar-Noy A. Kortsarz G.

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

Academic Press

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