Orthogonal H-decompositions.

zbMATH Open1049.05062MaRDI QIDQ2765166FDOQ2765166

Authors: Yair Caro, Raphael Yuster 

Publication date: 2001

Published in: Bulletin of the Institute of Combinatorics and its Applications (Search for Journal in Brave)

Recommendations

• Orthogonal decomposition and packing of complete graphs
• Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative
• Orthogonal decompositions of complete digraphs
• \([0,k_i]_1^m\)-factorizations orthogonal to a subgraph
• Orthogonal factorizations of graphs

zbMATH Keywords

orthogonal \(H\)-decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (14)

• On a problem of Hering concerning orthogonal covers of \({\mathbf K}_ n\)
• Mutually orthogonal cycle systems
• Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
• Transversal designs and induced decompositions of graphs
• Orthogonal decompositions of complete digraphs
• Self-orthogonal decompositions of graphs into matchings
• Trace estimates and invariance of the essential spectrum
• Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative
• Title not available (Why is that?)
• Orthogonal cycle systems with cycle length less than 10
• Orthogonal Hessenberg Reduction and Orthogonal Krylov Subspace Bases
• Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
• Orthogonally resolvable cycle decompositions
• Mutually orthogonal graph squares

This page was built for publication: Orthogonal \(H\)-decompositions.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765166)