On the decomposition of graphs into complete bipartite graphs

DOI10.1007/s00373-007-0722-3zbMath1122.05076OpenAlexW2437380516MaRDI QIDQ995755

Jinquan Dong, Yanpei Liu

Publication date: 10 September 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0722-3

zbMATH Keywords

OrientationComplete bipartite decompositionComplete bipartite valency

Mathematics Subject Classification ID

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

Related Items (6)

An overview of graph covering and partitioning ⋮ Local Clique Covering of Claw-Free Graphs ⋮ Unnamed Item ⋮ Biclique covers and partitions ⋮ Three ways to cover a graph ⋮ Erdős-Pyber theorem for hypergraphs and secret sharing

Cites Work

• Unnamed Item
• Bipartite dimensions and bipartite degrees of graphs
• Covering a graph by complete bipartite graphs
• The star arboricity of graphs
• Determination of the star valency of a graph
• Star arboricity of graphs
• On the decomposition ofkn into complete bipartite graphs
• The biparticity of a graph

This page was built for publication: On the decomposition of graphs into complete bipartite graphs