SEARCH

SEARCH BY CITATION

REFERENCES

  • 1
    A. Daneshgar and H. Hajiabolhassan, Circular colouring and algebraic no-homomorphism theorems, European J Combin 28(6) (2007), 18431853.
  • 2
    H. Hajiabolhassan, On colorings of graph powers, Discrete Math. 309(13) (2009), 42994305.
  • 3
    H. Hajiabolhassan and A. Taherkhani, Graph powers and graph homomorphisms, Electron J Combin 17(1) (2010), R17.
  • 4
    H. Hajiabolhassan and X. Zhu, Circular chromatic number of subgraphs, J Graph Theory 44(2) (2003), 95105.
  • 5
    A. Johnson, F. C. Holroyd and S. Stahl, Multichromatic numbers, star chromatic numbers and Kneser graphs, J Graph Theory 26(3) (1997), 137145.
  • 6
    M. Kneser, Aufgabe 360, Jahresbericht der Deutschen Mathematiker-Vereinigung 58(2) (1955), 27.
  • 7
    M. Larsen, J. Propp and D. Ullman, The fractional chromatic number of Mycielski's graphs, J Graph Theory 19(3) (1995), 411416.
  • 8
    L. Lovász, Kneser's conjecture, chromatic number, and homotopy, J Combin Theory Ser A 25(3) (1978), 319324.
  • 9
    A. Pirnazar and D. H. Ullman, Girth and fractional chromatic number of planar graphs, J Graph Theory 39(3) (2002), 201217.
  • 10
    E. R. Scheinerman and D. H. Ullman, Fractional graph theory, Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York, 1997. A rational approach to the theory of graphs, With a foreword by Claude Berge, A Wiley-Interscience Publication.
  • 11
    S. Stahl, The multichromatic numbers of some Kneser graphs, Discrete Math 185(1–3) (1998), 287291.
  • 12
    C. Tardif, Multiplicative graphs and semi-lattice endomorphisms in the category of graphs, J Combin Theory Ser B 95(2) (2005), 338345.
  • 13
    X. Zhu, Circular chromatic number: A survey, Discrete Math 229(1–3) (2001), 371410. Combinatorics, graph theory, algorithms and applications.
  • 14
    X. Zhu, Recent developments in circular colouring of graphs, In: Topics in Discrete Mathematics, volume 26 of Algorithms Combin., Springer, Berlin, 2006, pp. 497550.