Every forest is thus a 1-tree and every outerplanar graph is a partial 2-tree (recall that a planar graph is outerplanar if it admits a planar embedding such that every vertex lies on the outerface). In [35], Klostermeyer and MacGillivray proved that the maximum order of an o-...
Download: Download full-size image Fig. 2. For the proof of Theorem 4.1. The component Cy contains further vertices and edges outlined in grey. Lemma 4.1 Every k-colourable co-chordal graph is compact. Proof Let G be a k-colourable co-chordal graph. If G is a complete graph, then G...
comprising it; extracts of olive tree leaf; extracts of tea, in particular of green tea; anthocyans; extracts of rosemary; phenol acids, in particular chlorogenic acid; stilbenes, in particular resveratrol; sulphur- comprising amino acid derivatives, in particular S-carboxymethylcysteine; ergothioneine...
growth by multivariate image analysis. Appl. Sci. 2020, 10, 533. [Google Scholar] [CrossRef] [Green Version] Cancelliere, R.; Carbone, K.; Pagano, M.; Cacciotti, I.; Micheli, L. Biochar from brewers’ spent grain: A green and low-cost smart material to modify screen-printed ...