The following pages link to (Q3480087):
Displayed 28 items.
- Decomposition of certain complete bipartite graphs into prisms (Q505465) (← links)
- Completing partial packings of bipartite graphs (Q640856) (← links)
- Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (Q965963) (← links)
- Factorization of \(K_{n,n}\) into \((0,j)\)-prisms (Q989530) (← links)
- On a conjecture of Graham and Häggkvist with the polynomial method (Q1039430) (← links)
- A brief review on Egmont Köhler's mathematical work (Q1183961) (← links)
- The solution of the bipartite analogue of the Oberwolfach problem (Q1184002) (← links)
- Edge decomposition of complete tripartite graphs (Q1412671) (← links)
- Short solution of Kotzig's problem for bipartite graphs (Q1569037) (← links)
- Decomposition of 8-regular graphs into paths of length 4 (Q1689903) (← links)
- Decomposition of complete bipartite graphs into generalized prisms (Q1761503) (← links)
- Triangle-free Eulerian tours in graphs with maximum degree at most 4 (Q1842139) (← links)
- A generalized class-teacher model for some timetabling problems (Q1848400) (← links)
- Decomposition of \((2k + 1)\)-regular graphs containing special spanning \(2k\)-regular Cayley graphs into paths of length \(2k + 1\) (Q2142644) (← links)
- Decomposing 10-regular graphs into paths of length 5 (Q2158191) (← links)
- Decomposing \(2k\)-regular graphs into paths of length \(k\) (Q2164990) (← links)
- On decomposing regular graphs into isomorphic double-stars (Q2259570) (← links)
- Gregarious kite factorization of tensor product of complete graphs (Q2282461) (← links)
- Decomposing 8-regular graphs into paths of length 4 (Q2359970) (← links)
- \(C_{4p}\)-frame of complete multipartite multigraphs (Q2375912) (← links)
- Decomposing regular graphs with prescribed girth into paths of given length (Q2403689) (← links)
- On decomposing even regular multigraphs into small isomorphic trees (Q2449139) (← links)
- Decompositions of 6-regular bipartite graphs into paths of length six (Q2657084) (← links)
- (Q2857407) (← links)
- Edge-decompositions of<i>K<sub>n,n</sub></i>into isomorphic copies of a given tree (Q3159387) (← links)
- On a Häggkvist's Conjecture with the Polynomial Method (Q3503519) (← links)
- Decomposing almost complete graphs by random trees (Q5915750) (← links)
- Locally self-avoiding Eulerian tours (Q5915927) (← links)