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
  • Coloring the clique hypergraph of graphs without forbidden structure
    Gravier, Sylvain ; Škrekovski, Riste
    For a given simple connected graph ▫$G$▫ with at least one edge, the clique hypergraph is defined as the one with the same vertex set as ▫$G$▫ but whose hyperedges are the maximal cliques of ▫$G$▫. ... We characterize that ▫$C_5$▫ is the only graph without induced ▫$P_3+P_1$▫, whose clique hypergraph is not 2-colorable. We prove also that the clique hypergraph is 2-colorable providing that the underlined graph is without induced ▫$P_5$▫ and ▫$C_5$▫. The later result is best possible in the sense that we omit some of the forbidden graphs, then the claim ia not true.
    Vir: Preprint series. - ISSN 1318-4865 (Vol. 41, [št.] 890, 2003, str. 1-15)
    Vrsta gradiva - članek, sestavni del
    Leto - 2003
    Jezik - angleški
    COBISS.SI-ID - 12645721

vir: Preprint series. - ISSN 1318-4865 (Vol. 41, [št.] 890, 2003, str. 1-15)

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

Vnos na polico