0 KB388 KB36 KB200820252010Gross, Jonathan L.Khan, Imran F.Poshni, Mehvish Irfanštevilka:2letnik:3str. 121-138COBISSID:15857753ISSN:1855-3966URN:URN:NBN:SI:doc-GZ218MOAenDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneagrafimatematikateorija grafovGenus distribution of graph amalgamations: pasting when one root has arbitrary degree|This paper concerns counting the imbeddings of a graph in a surface. In the first installment of our current work, we showed how to calculate the genus distribution of an iterated amalgamation of copies of a graph whose genus distribution is already known and is further analyzed into a partitioned genus distribution (which is defined for a double-rooted graph). Our methods were restricted there to the case with two 2-valent roots. In this sequel we substantially extend the method in order to allow one of the two roots to have arbitrarily high valenceTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije