VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Circular colouring the plane
    DeVos, Matt ...
    The unit distance graph ▫$\mathcal{R}$▫ is the graph with vertex set ▫${\mathbb{R}}^2$▫ in which two vertices (points in the plane) are adjacent if and only if they are at Euclidean distance 1. We ... prove that the circular chromatic number of ▫$\mathcal{R}$▫ is at least 4, thus "tightening" the known lower bound on the chromatic number of ▫$\mathcal{R}$▫.
    Vir: Preprint series. - ISSN 1318-4865 (Vol. 44, št. 1005, 2006, str. 1-4)
    Vrsta gradiva - članek, sestavni del
    Leto - 2006
    Jezik - angleški
    COBISS.SI-ID - 14081881

vir: Preprint series. - ISSN 1318-4865 (Vol. 44, št. 1005, 2006, str. 1-4)
loading ...
loading ...
loading ...