You are here: Home - Cheap Nike Air Force 1 Low Uk have conjectured that if H is
Cheap Nike Air Force 1 Low Uk have conjectured that if H is
Unless otherwise stated, priced publications of the federal government are available from Canadian Government Publishing Centre, Supply and Services Canada, Hull, Quebec, Canada K1A 0S9. Orders from outside Canada are charged the higher of two prices to cover postage. Prepay to the Receiver General for Canada. Unless otherwise stated, priced publications of the Ontario provincial government are available from Publications Centre, Ministry of Government Services, 880 Bay Street, 5th floor, Toronto, Ontario, Canada M7A 1N8. Prepay to the Treasurer of Ontario. A well-known result of Hell and Nešetřil 1992 states that if H is a fixed non-bipartite graph, then it is an NP-complete problem to decide if there exists a homomorphism of a given graph G to H. The problem is polynomial if H is bipartite. The same authors have conjectured that, if H is non-bipartite, the problem remains NP-complete even if Cheap Nike Air Force 1 Low Uk restricted to instances where the input graph G admits a homomorphism to a fixed graph Y, unless there is a Cheap Air Max Thea Uk homomorphism of Y to H. We describe some progress on this conjecture, and the possibility of extending it to digraphs.