Narodna in univerzitetna knjižnica, Ljubljana (NUK)
Naročanje gradiva za izposojo na dom
Naročanje gradiva za izposojo v čitalnice
Naročanje kopij člankov
Urnik dostave gradiva z oznako DS v signaturi
  • The canonical coloring graph of trees and cycles
    Hass, Ruth
    For a graph ▫$G$▫ and an ordering of the vertices ▫$\pi$▫, the set of canonical ▫$k$▫-colorings of ▫$G$▫ under ▫$\pi$▫ is the set of non-isomorphic proper ▫$k$▫-colorings of ▫$G$▫ that are ... lexicographically least under ▫$\pi$▫. The canonical coloring graph Can▫$_k^\pi(G)$▫ is the graph with vertex set the canonical colorings of ▫$G$▫ and two vertices are adjacent if the colorings differ in exactly one place. This is a natural variation of the color graph ▫${\mathcal C}_k(G)$▫ where all colorings are considered. We show that every graph has a canonical coloring graph which is disconnected; that trees have canonical coloring graphs that are Hamiltonian; and cycles have canonical coloring graphs that are connected.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 5, no. 1, 2012, str. 149-157)
    Vrsta gradiva - članek, sestavni del
    Leto - 2012
    Jezik - angleški
    COBISS.SI-ID - 16272985

    Povezava(-e):

    http://amc.imfm.si/index.php/amc/article/view/168
    Digitalna knjižnica Slovenije - dLib.si

vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 5, no. 1, 2012, str. 149-157)

loading ...
loading ...
loading ...

Vnos na polico