The complexity of cover graph recognition for some varieties of finite lattices |
| |
Authors: | Vojtěch Rödl Luboš Thoma |
| |
Institution: | (1) Department of Mathematics and Computer Science, Emory University, 30322 Atlanta, Georgia, U.S.A. |
| |
Abstract: | We address the following decision problem: Instance: an undirected graphG. Problem: IsG a cover graph of a lattice? We prove that this problem is NP-complete. This extends results of Brightwell 5] and Ne?et?il and Rödl 12]. On the other hand, it follows from Alvarez theorem 2] that recognizing cover graphs of modular or distributive lattices is in P. An important tool in the proof of the first result is the following statement which may be of independent interest: Given an integerl, l?3, there exists an algorithm which for a graphG withn vertices yields, in time polynomial inn, a graphH with the number of vertices polynomial inn, and satisfying girth(H)?l and χ(H)=χ(G). |
| |
Keywords: | 03D15 05C15 06B05 |
本文献已被 SpringerLink 等数据库收录! |
|