Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Nontrivial convex covers of trees
Authors: Radu Buzatu, Sergiu Cataranciuc
– 0.14 Mb
Abstract
We establish conditions for the existence of nontrivial convex covers and nontrivial convex partitions of trees. We prove that a tree $G$ on $n\ge4$ vertices has a nontrivial convex $p$-cover for every $p$, $2\le p\le\varphi_{cn}^{max}(G)$. Also, we prove that it can be decided in polynomial time whether a tree on $n\ge6$ vertices has a nontrivial convex $p$-partition, for a fixed $p$, $2\le p\le \lfloor\frac{n}{3}\rfloor$.Moldova State University
60 A. Mateevici, MD-2009, Chisinau
Republic of Moldova
E-mail: ,
60 A. Mateevici, MD-2009, Chisinau
Republic of Moldova
E-mail: ,
Fulltext
– 0.14 Mb
Contents
- On (σ-δ)-rings over Noetherian rings
- On invariants and canonical form of matrices of second order with respect to semiscalar equivalence
- Resonant Riemann-Liouville Fractional Differential Equations with Periodic Boundary Conditions
- Cubic systems with degenerate infinity and invariant straight lines of total parallel multiplicity five
- Invariant integrability conditions for ternary differential systems with quadratic nonlinearities
- Nontrivial convex covers of trees
- An investment problem under multicriteriality, uncertainty and risk
- Uniqueness of certain power of a meromorphic function sharing a set with its differential monomial
- On a solution to equation with discrete multiplicative-additive derivative
