Browsing by Subject "nontrivial convex cover"

Browsing by Subject "nontrivial convex cover"

Sort by: Order: Results:

  • Buzatu, Radu (CEP USM, 2017)
    The nontrivial convex p-cover problem of a tree is studied.We propose the recursive formula that determines the maximum nontrivial convex cover number of a tree.
  • Buzatu, Radu; Cataranciuc, Sergiu (Institutul de Matematică şi Informatică al Academiei de Ştiinţe a Moldovei, 2018)
    In this paper we prove that it is NP-complete to decide whet- her a graph can be partitioned into nontrivial convex sets. We show that it can be verified in polynomial time whether a graph can be covered by nontrivial ...