Note edge-colourings of K n,n with no long two-coloured cycles

ISSN： 0209-9683

Source： Combinatorica, Vol.28, Iss.3, 2008-05, pp. : 373-378

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

A note on n-tuple colourings and circular colourings of planar graphs with large odd girth

By sparl P.

International Journal of Computer Mathematics, Vol. 84, Iss. 12, 2007-12 ,pp. : 1743-1746

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Note on the Recursive Sequence x n + 1 = pkxn + p k − 1 x n − 1 + … + p 1 x n − k + 1

By Stević S.

Ukrainian Mathematical Journal, Vol. 55, Iss. 4, 2003-04 ,pp. : 691-697

Springer Publishing Company

Access to resources Recommend Favorite

Two manufacturing applications of the fuzzy K-NN algorithm

By Liao T.W. Li D.

Fuzzy Sets and Systems, Vol. 92, Iss. 3, 1997-12 ,pp. : 289-303

Elsevier

Access to resources Recommend Favorite

Long-range order in linear ferromagnetic oscillator systems. Strong pair quadratic n-n potential

By Skrypnik V.

Ukrainian Mathematical Journal, Vol. 56, Iss. 6, 2004-06 ,pp. : 964-972

Springer Publishing Company

Access to resources Recommend Favorite

On the adjacent vertex distinguishing edge colourings of graphs

By Liu Bin Liu Guizhen

International Journal of Computer Mathematics, Vol. 87, Iss. 4, 2010-03 ,pp. : 726-732

Taylor & Francis Ltd

Access to resources Recommend Favorite