On packing bipartite graphs (Q1200276): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 06:55, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On packing bipartite graphs |
scientific article |
Statements
On packing bipartite graphs (English)
0 references
17 January 1993
0 references
Two simple graphs \(G\) and \(H\) can be packed if \(G\) is isomorphic to a subgraph of the complement \(\overline H\) of \(H\). A sufficient condition is known for the existence of packing in terms of the product of the maximal degrees of \(G\) and \(H\). The paper improves this result for bipartite graphs by presenting a condition involving products of a maximum degree with an average degree, which guarantees a packing of the two bipartite graphs.
0 references
packing
0 references
bipartite graphs
0 references
degree
0 references