On the bipartite graph packing problem
classification
🧮 math.CO
keywords
bipartitegraphpackingproblemalmostareaconditionsconsider
read the original abstract
The graph packing problem is a well-known area in graph theory. We consider a bipartite version and give almost tight conditions on the packability of two bipartite sequences.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.