scientific article; zbMATH DE number 4150219
From MaRDI portal
Publication:3480087
Recommendations
- Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12
- Decomposition of complete graphs into isomorphic complete bipartite graphs
- Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)
- Decompositions of complete graphs into bipartite 2-regular subgraphs
- Decomposition of complete graphs into arbitrary trees
Cited in
(47)- On a conjecture of Graham and Häggkvist with the polynomial method
- Decompositions of regular bipartite graphs
- A brief review on Egmont Köhler's mathematical work
- The solution of the bipartite analogue of the Oberwolfach problem
- Edge decomposition of complete tripartite graphs
- Complete multipartite decompositions of complete graphs and complete n-partite graphs
- Short solution of Kotzig's problem for bipartite graphs
- Decomposition of 8-regular graphs into paths of length 4
- Decomposition of complete bipartite graphs into generalized prisms
- Triangle-free Eulerian tours in graphs with maximum degree at most 4
- A generalized class-teacher model for some timetabling problems
- Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs
- Decomposition 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 5
- Decomposing 2k-regular graphs into paths of length k
- On decomposing regular graphs into isomorphic double-stars
- Gregarious kite factorization of tensor product of complete graphs
- Decomposing 8-regular graphs into paths of length 4
- \(C_{4p}\)-frame of complete multipartite multigraphs
- Decomposing regular graphs with prescribed girth into paths of given length
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- On decomposing even regular multigraphs into small isomorphic trees
- Decompositions of 6-regular bipartite graphs into paths of length six
- On canonical decomposition of bipartite graphs
- Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)
- Edge-decompositions ofKn,ninto isomorphic copies of a given tree
- scientific article; zbMATH DE number 5008680 (Why is no real title available?)
- Decomposition of complete bipartite graphs into open trails
- On a Häggkvist's Conjecture with the Polynomial Method
- scientific article; zbMATH DE number 617585 (Why is no real title available?)
- scientific article; zbMATH DE number 1109398 (Why is no real title available?)
- Decompositions of multigraphs into parts with two edges
- Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12
- Decomposition of certain complete bipartite graphs into prisms
- Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs
- Decomposition of complete graphs into isomorphic complete bipartite graphs
- Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 7325724 (Why is no real title available?)
- Decomposing almost complete graphs by random trees
- Completing partial packings of bipartite graphs
- Transitive path decompositions of Cartesian products of complete graphs
- Packing large balanced trees into bipartite graphs
- On f-derangements and decomposing bipartite graphs into paths
- An unusual decomposition of a complete 7-partite graph of order 28
- Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
- Factorization of \(K_{n,n}\) into \((0,j)\)-prisms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3480087)
