Colouring Cubic Graphs by Small Steiner Triple Systems

ISSN： 0911-0119

Source： Graphs and Combinatorics, Vol.23, Iss.2, 2007-04, pp. : 217-228

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

Related content

On the Intersection Problem for Steiner Triple Systems of Different Orders

By Danziger Peter Dukes Peter Griggs Terry Mendelsohn Eric

Graphs and Combinatorics, Vol. 22, Iss. 3, 2006-11 ,pp. : 311-329

Springer Publishing Company

Access to resources Recommend Favorite

Large Cross‐Free Sets in Steiner Triple Systems

JOURNAL OF COMBINATORIAL DESIGNS, Vol. 23, Iss. 8, 2015-08 ,pp. : 321-327

John Wiley & Sons Inc

Access to resources Recommend Favorite

On equitable colouring of Knödel graphs

By Kaliraj K. Vivin J. Vernold Akbar Ali M.M.

International Journal of Computer Mathematics, Vol. 91, Iss. 7, 2014-07 ,pp. : 1428-1433

Taylor & Francis Ltd

Access to resources Recommend Favorite

On reductions for the Steiner Problem in Graphs

By Kingston J.H. Sheppard N.P.

Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. : 77-88

Elsevier

Access to resources Recommend Favorite

Generalized Steiner Triple Systems with Group Size g ≡ 0,3 (mod 6)

By Ge Gen-nian

Acta Mathematicae Applicatae Sinica, Vol. 18, Iss. 4, 2002-11 ,pp. : 561-568

Springer Publishing Company

Access to resources Recommend Favorite