Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article - MaRDI portal

scientific article

From MaRDI portal
Publication:3480087

zbMath0702.05065MaRDI QIDQ3480087

Roland Haeggkvist

Publication date: 1989


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (28)

Decomposing 8-regular graphs into paths of length 4Edge-decompositions ofKn,ninto isomorphic copies of a given tree\(C_{4p}\)-frame of complete multipartite multigraphsDecomposition of \((2k + 1)\)-regular graphs containing special spanning \(2k\)-regular Cayley graphs into paths of length \(2k + 1\)Decomposing 10-regular graphs into paths of length 5Decomposing \(2k\)-regular graphs into paths of length \(k\)Decompositions of 6-regular bipartite graphs into paths of length sixDecomposing regular graphs with prescribed girth into paths of given lengthOn a Häggkvist's Conjecture with the Polynomial MethodDecomposition of 8-regular graphs into paths of length 4Edge decomposition of complete tripartite graphsCompleting partial packings of bipartite graphsOn decomposing even regular multigraphs into small isomorphic treesA brief review on Egmont Köhler's mathematical workThe solution of the bipartite analogue of the Oberwolfach problemDecomposing almost complete graphs by random treesDecomposition of certain complete bipartite graphs into prismsEvery tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)Decomposition of complete bipartite graphs into generalized prismsOn decomposing regular graphs into isomorphic double-starsUnnamed ItemFactorization of \(K_{n,n}\) into \((0,j)\)-prismsLocally self-avoiding Eulerian toursGregarious kite factorization of tensor product of complete graphsShort solution of Kotzig's problem for bipartite graphsOn a conjecture of Graham and Häggkvist with the polynomial methodTriangle-free Eulerian tours in graphs with maximum degree at most 4A generalized class-teacher model for some timetabling problems






This page was built for publication: