DIKUL - logo
(UL)
PDF
  • 1-perfectly orientable ▫$K_4$▫-minor-free and outerplanar graphs [Elektronski vir]
    Brešar, Boštjan ...
    A graph ▫$G$▫ is said to be 1-perfectly orientable if it has an orientation ▫$D$▫ such that for every vertex ▫$v \in V(G)v$▫, the out-neighborhood of v in ▫$D$▫ is a clique in ▫$G$▫. We characterize ... the class of 1-perfectly orientable $K_4$-minor-free graphs. As a consequence we obtain a characterization of 1-perfectly orientable outerplanar graphs.
    Vir: Electronic notes in discrete mathematics [Elektronski vir]. - ISSN 1571-0653 (Vol. 54, Oct. 2016, str. 199-204)
    Vrsta gradiva - e-članek ; neleposlovje za odrasle
    Leto - 2016
    Jezik - angleški
    COBISS.SI-ID - 1538794180

    Povezava(-e):

    http://dx.doi.org/10.1016/j.endm.2016.09.035
    DOI

Vnos na polico