Maximum induced trees in graphs
- 作者Paul Erdös; Michael Saks; Vera T Sós
- 卷第41卷
- 期第1期
- 印刷ISSN0095-8956
- 电子ISSN1096-0902
- 文件大小951.56KB
- 发表时间1986
- DOI10.1016/0095-8956(86)90028-6
- 页码61-79
同作者推荐
Isomorphic edge disjoint subgraphs of hypergraphsHorn, Paul; Koubek, Václav; Rödl, Vojtěch · Random Structures & Algorithms · 2016
On graphs with a given endomorphism monoidVáclav Koubek; Vojtěch Rödl; Benjamin Shemmer · 2009
REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHSKOUBEK, VÁCLAV; RÖDL, VOJTĚCH; SHEMMER, BENJAMIN · International Journal of Algebra and Computation · 2009
On the number of graphs with a given endomorphism monoidVáclav Koubek; Vojtěch Rödl · 2010
On a conjecture of Thomassen concerning subgraphs of large girthDomingos Dellamonica Jr; Václav Koubek; Daniel M. Martin; Vojtěch Rödl · 2011