On the decomposition of graphs into complete bipartite graphs
From MaRDI portal
Publication:995755
DOI10.1007/S00373-007-0722-3zbMATH Open1122.05076OpenAlexW2437380516MaRDI QIDQ995755FDOQ995755
Authors: Jin Quan 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
Recommendations
Cites Work
- Covering a graph by complete bipartite graphs
- The star arboricity of graphs
- Title not available (Why is that?)
- The biparticity of a graph
- On the decomposition ofkn into complete bipartite graphs
- Bipartite dimensions and bipartite degrees of graphs
- Star arboricity of graphs
- Determination of the star valency of a graph
Cited In (29)
- Title not available (Why is that?)
- The splitting number of complete bipartite graphs
- Title not available (Why is that?)
- An overview of graph covering and partitioning
- Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs
- Title not available (Why is that?)
- Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges
- Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- On canonical decomposition of bipartite graphs
- On the cyclic decomposition of complete graphs into almost-bipartite graphs
- Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs
- Title not available (Why is that?)
- Sharp bounds for decompositions of graphs into completer-partite subgraphs
- Title not available (Why is that?)
- The bigraph decomposition number of a graph
- Biclique covers and partitions
- Erdős-Pyber theorem for hypergraphs and secret sharing
- Graph-Theoretic Concepts in Computer Science
- Decompositions of regular bipartite graphs
- Problems and invariants connected with bicliques and multicliques of graphs
- Three ways to cover a graph
- Title not available (Why is that?)
- Local clique covering of claw-free graphs
- Title not available (Why is that?)
- On the complexity of construction of complete and complete bipartite graphs
- On complementary decompositions of the complete graph
- Decomposition of product graphs into complete bipartite subgraphs
- An unusual decomposition of a complete 7-partite graph of order 28
This page was built for publication: On the decomposition of graphs into complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995755)
