Connectivity of Matching Graph of Hypercube
The matching graph $\mathcal{M}(G)$ of a graph $G$ has a vertex set of all perfect matchings of $G$, with two vertices being adjacent whenever the union of the corresponding perfect matchings forms a...
The matching graph $\mathcal{M}(G)$ of a graph $G$ has a vertex set of all perfect matchings of $G$, with two vertices being adjacent whenever the union of the corresponding perfect matchings forms a...
You are not logged in to this journal. Log in
Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics
SIAM J. Discrete Math. Volume 23, Issue 2, pp. 1110-1115 (2009)
Published June 26, 2009
Connotea
CiteULike
del.icio.us
BibSonomy
There exist finite universal immersion spaces for the following: (a) Edge-colored graphs of bounded degree and boundedly many colors. (b) Nearest-neighbor metrics of bounded degree and boundedly many edge lengths.
©2009 Society for Industrial and Applied Mathematics| History: | Received February 12, 2008; accepted March 15, 2009; published June 26, 2009 |
| Permalink: | http://dx.doi.org/10.1137/08071555X |
KEYWORDS and AMS
05C12, 05C15, 51F15
PUBLICATION DATA
0895-4801 (print)
1095-7146 (online)
SIAM