<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">388091428</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180307125253.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161130e199902  xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1017/S0004972700032627</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">S0004972700032627</subfield>
   <subfield code="2">pii</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)cambridge-10.1017/S0004972700032627</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">zhu</subfield>
   <subfield code="D">Xuding</subfield>
   <subfield code="u">Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan 80424 e-mail: zhu@math.nsysu.edu.tw</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Circular colouring and graph homomorphism</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Xuding zhu]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">For any pair of integers p, q such that (p, q) = 1 and p ≥ 2q, the graph has vertices {0, 1, ..., p − 1} and edges {ij: q ≤ |i − j| ≤ p − q}. These graphs play the same role in the study of circular chromatic number as that played by the complete graphs in the study of chromatic number. The graphs share many properties of the complete graphs. However, there are also striking differences between the graphs and the complete graphs. We shall prove in this paper that for many pairs of integers p, q, one may delete most of the edges of so that the resulting graph still has circular chromatic number p/q. To be precise, we shall prove that for any number r &lt; 2, there exists a rational number p/q (where (p, q) = 1) which is less than r but arbitrarily close to r, such that contains a subgraph H with and . This is in sharp contrast to the fact that the complete graphs are edge critical, that is, the deletion of any edge will decrease its chromatic number and its circular chromatic number.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Copyright © Australian Mathematical Society 1999</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Bulletin of the Australian Mathematical Society</subfield>
   <subfield code="d">Cambridge University Press</subfield>
   <subfield code="g">59/1(1999-02), 83-97</subfield>
   <subfield code="x">0004-9727</subfield>
   <subfield code="q">59:1&lt;83</subfield>
   <subfield code="1">1999</subfield>
   <subfield code="2">59</subfield>
   <subfield code="o">BAZ</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1017/S0004972700032627</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1017/S0004972700032627</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">zhu</subfield>
   <subfield code="D">Xuding</subfield>
   <subfield code="u">Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan 80424 e-mail: zhu@math.nsysu.edu.tw</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Bulletin of the Australian Mathematical Society</subfield>
   <subfield code="d">Cambridge University Press</subfield>
   <subfield code="g">59/1(1999-02), 83-97</subfield>
   <subfield code="x">0004-9727</subfield>
   <subfield code="q">59:1&lt;83</subfield>
   <subfield code="1">1999</subfield>
   <subfield code="2">59</subfield>
   <subfield code="o">BAZ</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="b">CC0</subfield>
   <subfield code="u">http://creativecommons.org/publicdomain/zero/1.0</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-cambridge</subfield>
  </datafield>
 </record>
</collection>
