UP - logo
Univerza na Primorskem Univerzitetna knjižnica - vsi oddelki (UPUK)
PDF
  • ▫$1$▫-perfectly orientable graphs and graph products
    Hartinger, Tatiana Romina ; Milanič, Martin, 1980-
    A graph ▫$G$▫ is said to be ▫$1$▫-perfectly orientable (▫$1$▫-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex is a clique in ▫$G$▫. The class of ▫$1$▫-p.o. ... graphs forms a common generalization of the classes of chordal and circular arc graphs. Even though ▫$1$▫-p.o. graphs can be recognized in polynomial time, no structural characterization of ▫$1$▫-p.o. graphs is known. In this paper we consider the four standard graph products: the Cartesian product, the strong product, the direct product, and the lexicographic product. For each of them, we characterize when a nontrivial product of two graphs is ▫$1$▫-p.o.
    Vir: Discrete mathematics. - ISSN 0012-365X (2016, 11 str.)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2016
    Jezik - angleški
    COBISS.SI-ID - 1539009220

    Povezava(-e):

    http://dx.doi.org/10.1016/j.disc.2016.09.023
    DOI

Vnos na polico