Search Results

You are looking at 1 - 10 of 4,512 items for :

Clear All
Open access

András Gyárfás

References [1] D. Gerbner, B. Keszegh and C. Palmer, Generalizations of the tree packing conjecture, Discuss. Math. Graph Theory 32 (2012) 569-582. doi:10.7151/dmgt.1628 [2] D. Gerbner, B. Keszegh and C. Palmer, Red-blue alternating paths, Third Emléktábla Workshop, p.25. http://www.renyi.hu/emlektab/index/booklet.html [3] A. Gyárfás and J. Lehel, Packing trees of different order into Kn, Combinatorics, Proc. Fifth Hungarian Coll. Keszthely, 1976, Vol II. North Holland. Colloq. Math. Soc. J. Bolyai 18 463

Open access

Hiroyuki Okazaki, Yuichi Futa and Yasunari Shidama

References [1] Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics , 1( 2 ):377-382, 1990. [2] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics , 1( 1 ):41-46, 1990. [3] Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics , 1( 1 ):91-96, 1990. [4] Grzegorz Bancerek. Introduction to trees. Formalized Mathematics , 1( 2 ):421-427, 1990. [5] Grzegorz Bancerek. K¨onig’s lemma. Formalized Mathematics , 2( 3 ):397

Open access

Ian Short

References [1] C.A. Barefoot, R.C. Entringer and L.A. Sz´ekely, Extremal values for ratios of dis- tances in trees, Discrete Appl. Math. 80 (1997) 37-56. doi:10.1016/S0166-218X(97)00068-1 [2] A.A. Dobrynin, R. Entringer and I. Gutman, Wiener index of trees: theory and applications, Acta Appl. Math 66 (2001) 211-249. doi:10.1023/A:1010767517079 [3] L. Johns and T.C. Lee, S-distance in trees, in: Computing in the 90’s (Kalamazoo, MI, 1989), Lecture Notes in Comput. Sci., 507, N.A. Sherwani, E. de Doncker and J

Open access

Pēteris Grabusts, Arkādijs Borisovs and Ludmila Aleksejeva

References [1] M. G. Matveev, A. S. Sviridov and N. A. Aleynikova, Models and methods of artificial intelligence. Application in Economics, Finansy i statistika, 2008, 447 p. (in Russian). [2] T. M. Mitchell, Machine learning. McGraw-Hill, 1997, 414 p. [3] J. R. Quinlan, C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, 1993. [4] L. Breiman, J. H. Friedman, R. Olshen and C. J. Stone, Classification and regression trees. Belmont, CA: Wadsworth, 1984. [5] F. Kharbat

Open access

Damian Bogdanowicz and Krzysztof Giaro

References Alberich, R., Cardona, G., Rosselló, F. and Valiente, G. (2009). An algebraic metric for phylogenetic trees, Applied Mathematics Letters 22 (9): 1320-1324. Aldous, D.J. (1991). The continuum random tree II: An overview, in M.T. Barlow and N. H. Bingham (Eds.), Stochastic Analysis , Cambridge University Press, Cambridge, pp. 23-70. Bansal, M., Burleigh, J.G., Eulenstein, O. and Fernández-Baca, D. (2010). Robinson-Foulds supertrees, Algorithms for Molecular Biology 5 (1): 18

Open access

Ágnes Takács, Márton Kiss, Eszter Tanács, Levente Varga and Ágnes Gulyás

evidence. Landscape and Urban Planning 97, 147–155. DOI: 10.1016/j.landurbplan.2010.05.006 Day, S.D., Dickinson, S.B. 2008: Managing Stormwater for Urban Sustainability using Trees and Structural Soils. Virginia Polytechnic Institute and State University, Blacksburg, VA. Égerházi, L.A., Kovács, A., Unger, J. 2013. Application of microclimate modelling and onsite survey in planning practice related to an urban micro environment. Adv Meteorol, 2013, Article ID 251586. DOI: 10.1155/2013/251586 Gaskó, B. 2008. Móra Ferenc Múzeum évkönyve

Open access

D. Pillone

R eferences [1] H. Alpert, Rank numbers of grid graphs , Discrete Math. 310 (2010) 3324–3333. doi:10.1016/j.disc.2010.07.022 [2] H.L. Bodlaender, J.R. Gilbert, H. Hafsteinsson and T. Kloks, Approximating treewidth, pathwidth, frontsize, and shortest elimination tree , J. Algorithms 18 (1995) 238–255. doi:10.1006/jagm.1995.1009 [3] H.L. Bodlaender, J.S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Muller and Zs. Tuza, Rankings of graphs , SIAM J. Discrete Math. 11 (1998) 168–181. doi:10.1137/S0895480195282550 [4] G. Chartrand and P

Open access

Hajime Matsumura

References [1] M.N. Ellingham, Y. Nam and H.-J. Voss, Connected (g, f)-factors, J. Graph Theory 39 (2002) 62-75. doi:10.1002/jgt.10019 [2] H. Enomoto and K. Ozeki, The independence number condition for the existence of a spanning f-tree, J. Graph Theory 65 (2010) 173-184. doi:10.1002/jgt.20471 [3] H. Matsuda and H.Matsumura, On a k-tree containing specified leaves in a graph, Graphs Combin. 22 (2006) 371-381. doi:10.1007/s00373-006-0660-5 [4] H.Matsuda and H.Matsumura, Degree conditions and

Open access

Sławomir Kaczmarek, Tomasz Marquardt and Katarzyna Faleńczyk-Koziróg

: Mesostigmata) of Polish national parks compared to other areas]. Kosmos 51/4: 463-470 (in Polish). Bregetova I.G. 1977. Opredelitel obitayushchikh w pochve kleshchei [Identification key to soil-inhabiting mites Mesostigmata]. AN SSSR, Leningrad (in Russian). Gutowski M., Bobiec A., Pawlaczyk P., Zub K. 2004. Drugie życie drzewa [Second life of a tree]. WWF Polska, Warszawa (in Polish). Gwiazdowicz D. J. 1999. Mites (Acari, Gamasida) occurring in tree-hollows in the Białowieza National Park. AR

Open access

Jacek Zajączkowski and Kazimierz Zajączkowski

REFERENCES Bałazy S., 2002, Ecological guidelines for the management of afforestations in rural areas , [in:] Ryszkowski L. (ed.), Landscape ecology in agroecosystems management , CRC Press, Boca Raton, 299–316. Górka W., 1989, Penetracja gruntów uprawnych przez korzenie drzew niektórych gatunków w zadrzewieniach , ( Ground penetration by roots of some tree species outside forest ,) Prace IBL, 678, 3–26. IPCC, 2014, Fifth Assessment Report, http://www.ipcc.ch Jankowiak J., 2010, Ekonomiczne uwarunkowania wprowadzania zadrzewień