Decomposition of bipartite graphs into special subgraphs

DOI10.1016/J.DAM.2006.06.011zbMATH Open1114.05078OpenAlexW2162801091MaRDI QIDQ868396FDOQ868396

Authors Guantao Chen, R. H. Schelp

Publication date 2 March 2007

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2006.06.011

zbMATH Keywords

orthogonal factorizationcomplete bipartite graphs

Mathematics Subject Classification ID

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

Recommendations

• \([0,k_i]_1^m\)-factorizations orthogonal to a subgraph
• scientific article; zbMATH DE number 1910367
• Orthogonal \((g,f)\)-factorizations of bipartite \((mg+k-1,mf-k+1)\)-graphs
• scientific article; zbMATH DE number 77943
• Orthogonal factorizations of graphs

Cites work

• scientific article; zbMATH DE number 124514 (Why is no real title available?)
• scientific article; zbMATH DE number 2200042 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• A communication problem and directed triple systems

Cited in

(4)

• Graph-Theoretic Concepts in Computer Science
• Decompositions of regular bipartite graphs
• Decomposition of a graph into two disjoint odd subgraphs
• Decomposing a graph into two subgraphs with prescribed parities of vertex degrees

This page was built for publication: Decomposition of bipartite graphs into special subgraphs

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