A minimum degree condition forcing complete graph immersion
An immersion of a graph H into a graph G is a one-to-one mapping f: V (H) → V (G) and a collection of edge-disjoint paths in G, one for each edge of H, such that the path P [subscript uv] corresponding to edge uv has endpoints f(u) and f(v). The immersion is strong if the paths P [subscript uv] are...
| Main Authors: | , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Springer-Verlag
2015
|
| Online Access: | http://hdl.handle.net/1721.1/92854 |