On the quantum chromatic number of a graph.

Cameron, Peter J.; Montanaro, Ashley; Newman, Michael W.; Severini, Simone; Winter, Andreas

Displaying similar documents to “On the quantum chromatic number of a graph.”

The tripartite separability of density matrices of graphs.

Wang, Zhen, Wang, Zhixi (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Upper and lower bounds for $F_{v} (4, 4; 5)$ .

Xu, Xiaodong, Luo, Haipeng, Shao, Zehui (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Uniquely $n$ -colorable and chromatically equivalent graphs.

Chao, Chong-Yun (2001)

Bulletin of the Malaysian Mathematical Sciences Society. Second Series

Similarity:

On the number of orthogonal systems in vector spaces over finite fields.

Le Anh Vinh (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Dense $H$ -free graphs are almost $(χ (H) - 1)$ -partite.

Allen, Peter (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the functions with values in $[α (G), \bar{χ} (G)]$ .

Dobrynin, V., Pliskin, M., Prosolupov, E. (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Colouring the petals of a graph.

Cariolaro, David, Cariolaro, Gianfranco (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Graph powers and graph homomorphisms.

Hajiabolhassan, Hossein, Taherkhani, Ali (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Supermagic Graphs Having a Saturated Vertex

Jaroslav Ivančo, Tatiana Polláková (2014)

Discussiones Mathematicae Graph Theory

Similarity:

A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.

The coarseness of a graph

Lowell W. Beineke, Gary Chartrand (1968)

Compositio Mathematica

Similarity:

Induced complete $h$ -partite graphs in dense clique-less graphs.

Fischer, Eldar (1999)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Homomorphisms of complete n-partite graphs.

Girse, Robert D. (1986)

International Journal of Mathematics and Mathematical Sciences

Similarity: