Premium
The existence of k ‐to‐1 continuous maps between graphs when k is sufficiently large
Author(s) -
Hilton A. J. W.
Publication year - 1993
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190170402
Subject(s) - mathematics , combinatorics , graph , set (abstract data type) , discrete mathematics , computer science , programming language
Jo Heath and the author found a set of necessary and sufficient conditions for the existence of an exactly k ‐to‐1 map from a graph G to a graph H. These conditions were all local ones. Here this result is used to give necessary and sufficient conditions for the existence of an exactly k ‐to‐1 map from G to H when k is sufficiently large. The conditions for this are global in nature. © 1993 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom