Maximum nontrivial convex cover of a tree
Închide
Articolul precedent
Articolul urmator
565 3
Ultima descărcare din IBN:
2023-12-05 10:12
SM ISO690:2012
BUZATU, Radu. Maximum nontrivial convex cover of a tree. In: Conference of Mathematical Society of the Republic of Moldova, 28 iunie - 2 iulie 2017, Chişinău. Chişinău: Centrul Editorial-Poligrafic al USM, 2017, 4, pp. 365-368. ISBN 978-9975-71-915-5.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Conference of Mathematical Society of the Republic of Moldova
4, 2017
Conferința "Conference of Mathematical Society of the Republic of Moldova"
Chişinău, Moldova, 28 iunie - 2 iulie 2017

Maximum nontrivial convex cover of a tree

Pag. 365-368

Buzatu Radu
 
Moldova State University
 
 
Disponibil în IBN: 5 octombrie 2017


Rezumat

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.

Cuvinte-cheie
Convexity, nontrivial convex cover, Tree