Search results
Jump to navigation
Jump to search
- ...ge-disjoint [[spanning tree]]s (and more generally [[Forest (graph theory)|forests]]) a graph can have: ...e actual definition of [[arboricity]] is slightly different and applies to forests rather than trees.) ...4 KB (626 words) - 23:51, 27 February 2025
- Linear arboricity is a variation of [[arboricity]], the minimum number of forests that the edges of a graph can be partitioned into. Researchers have also st ...ear arboricity is always two,{{r|axh}} and a decomposition into two linear forests can be found in [[linear time]] using an algorithm based on [[depth-first s ...7 KB (979 words) - 16:46, 14 August 2024
- | sights = Primary and secondary forests Under RKN 7, additional efforts were introduced to conserve and protect forests for both economic and environmental benefits. The forestry sector contribut ...4 KB (546 words) - 16:51, 27 December 2024
- ...t2=Trevor|last3=Efron|first3=Bradley|title=Confidence Intervals for Random Forests: The Jackknife and the Infinitesimal Jackknife|journal=Journal of Machine L ...=15,19 and 57. The results shows in paper( Confidence Intervals for Random Forests: The jackknife and the [[Infinitesimal]] Jackknife ) that m = 57 random for ...4 KB (619 words) - 17:21, 21 February 2025
- ...ams|first=Crispin St. John Alvah|title=Decomposition of finite graphs into forests|journal=[[Journal of the London Mathematical Society]]|volume=39|issue=1|ye | title = Covering planar graphs with forests ...9 KB (1,015 words) - 22:57, 2 November 2024
- ...]] of an [[undirected graph]], the minimum number of [[tree (graph theory)|forests]] needed to cover all of its edges. Matroid partitioning may be solved in [ ...e edges of the [[complete bipartite graph]] ''K''<sub>4,4</sub> into three forests, showing that it has arboricity at most three]] ...13 KB (2,168 words) - 03:57, 9 November 2024
- === Acyclic graphs (forests) === === Acyclic graphs (forests) === ...21 KB (3,683 words) - 22:34, 25 November 2024
- ...Roberts |first2=John A. |date=May 1974 |title=On Ramsey numbers for linear forests |journal=Discrete Mathematics |publisher=North-Holland Publishing Company | ...hael Scott Jacobson |date=28 March 2009 |title=Pancyclic graphs and linear forests |journal=Discrete Mathematics |publisher=Elsevier B.V. |volume=309 |issue=5 ...8 KB (1,124 words) - 03:21, 9 February 2025
- ...of at most seven vertices, [[Cycle graph|cycles]], [[Forest (graph theory)|forests]], [[complete graph]]s, [[interval graph]]s and [[ladder graph]]s.<ref name ...4 KB (547 words) - 21:47, 1 September 2023
- * In a [[graphic matroid]], where the independent sets are the forests, the bases are called the ''[[spanning forest]]s'' of the graph. ...11 KB (1,769 words) - 01:19, 9 November 2024
- ...er Status as a Tool to Monitor the Risk of Drought-Induced Forest Decline. Forests 2020, 11, 77</ref> ...er Status as a Tool to Monitor the Risk of Drought-Induced Forest Decline. Forests 2020, 11, 77</ref> particularly relevant in the context of climate change. ...8 KB (1,208 words) - 04:04, 30 December 2024
- ...ear = 1970 | title = Herbivores and the Number of Tree Species in Tropical Forests | journal = The American Naturalist | volume = 104 | issue = 940| page = 94 ...s does not negate that Janzen-Connell effects may also happen in temperate forests. The [[Prunus serotina|black cherry]] is one such example of a [[temperate ...22 KB (3,195 words) - 16:59, 12 November 2024
- ...d=yes }}</ref> that are grown by [[chemical vapor deposition]] (CVD). The "forests" can grow to heights of up to 6 millimeters.<ref>{{cite journal|title=Chara For CNTs arranged in groups/bundles called "forests" as described earlier, efficient packing and good alignment in necessary be ...13 KB (2,120 words) - 14:33, 14 January 2024
- | title = Around the Danzer problem and the construction of dense forests | title = Dense forests and Danzer sets ...10 KB (1,473 words) - 21:32, 19 September 2024
- ...e the game chromatic number of forests with vertices of degree 3, even for forests with maximum degree 3. ...tices with degree 4, then <math>\chi'_g(F) \le 5</math>.<ref>Conditions on forests with Δ=4 are in {{harvtxt|Chan|Nong|2014}}</ref> ...31 KB (4,244 words) - 02:09, 28 February 2025
- ...ree colors, so the two-color induced subgraphs are [[forest (graph theory)|forests]]. If we denote the acyclic chromatic number of a graph {{mvar|G}} by {{tm ...5 KB (635 words) - 09:41, 16 July 2024
- ...most equal to the [[arboricity]] of the same graph (the minimum number of forests into which it can be partitioned) and at least equal to the arboricity divi ...11 KB (1,538 words) - 12:55, 26 February 2025
- 5 KB (701 words) - 01:22, 11 January 2024
- ...pection reveals the type of historic land-use under contemporary temperate forests in Europe |journal=Scientific Reports |language=en |volume=14 |issue=1 |pag ...5 KB (724 words) - 09:28, 19 November 2024
- ...es is equivalent to a land area that, if filled with [[carbon sink]]s like forests, would balance carbon dioxide emissions.<ref>{{cite journal |last1=Blomqvis ...12 KB (1,606 words) - 10:42, 6 January 2025