Two graph-colouring games

E-ISSN： 1755-1633|48|1|141-149

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.48, Iss.1, 1993-08, pp. : 141-149

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

Circular colouring and graph homomorphism

Bulletin of the Australian Mathematical Society, Vol. 59, Iss. 1, 1999-02 ,pp. : 83-97

Cambridge University Press

Access to resources Recommend Favorite

Colouring Relatives of Intervals on the Plane, II: Intervals and Rays in Two Directions

By Kostochka A.V. Nesetril J.

European Journal of Combinatorics, Vol. 23, Iss. 1, 2002-01 ,pp. : 37-41

Elsevier

Access to resources Recommend Favorite

The largest two Laplacian eigenvalues of a graph

By Kinkar Ch. Das

Linear and Multilinear Algebra, Vol. 52, Iss. 6, 2004-11 ,pp. : 441-460

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the graph of a function in two variables over a finite field

By Ball Simeon Lavrauw Michel

Journal of Algebraic Combinatorics, Vol. 23, Iss. 3, 2006-05 ,pp. : 243-253

Springer Publishing Company

Access to resources Recommend Favorite

Two Badly Behaved Percolation Processes on a Nonunimodular Graph

By Häggström Olle

Journal of Theoretical Probability, Vol. 26, Iss. 4, 2013-12 ,pp. : 1165-1180

Springer Publishing Company

Access to resources Recommend Favorite