Digitale Medien
Springer
Combinatorica
12 (1992), S. 295-301
ISSN:
1439-6912
Schlagwort(e):
05 C 70
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
Abstract G andH, two simple graphs, can be packed ifG is isomorphic to a subgraph of $$\overline H$$ , the complement ofH. A theorem of Catlin, Spencer and Sauer gives a sufficient condition for the existence of packing in terms of the product of the maximal degrees ofG andH. We improve this theorem for bipartite graphs. Our condition involves products of a maximum degree with an average degree. Our relaxed condition still guarantees a packing of the two bipartite graphs.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01285818
Permalink
|
Standort |
Signatur |
Erwartet |
Verfügbarkeit |
