A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10114-011-9617-6 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-011-9617-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061942211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erd�s-S�s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic solution for a new class of forbidden r-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3114975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Sós conjecture for spiders / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős‐Sós Conjecture for trees of diameter four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing a tree with a graph of the same size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3114952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdös-Sós conjecture for graphs of girth 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdös-Sós conjecture for graphs without \(C_ 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Trees in Graphs whose Complement has no <b><i>K</i></b><sub>2,<b><i>s</i></b></sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variation of a conjecture due to Erdös and Sós / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10114-011-9617-6 / rank
 
Normal rank

Latest revision as of 21:06, 9 December 2024

scientific article
Language Label Description Also known as
English
A sufficient degree condition for a graph to contain all trees of size \(k\)
scientific article

    Statements

    Identifiers