The complexity of cover graph recognition for some varieties of finite lattices
type: Item
instance of: scholarly article
title: The complexity of cover graph recognition for some varieties of finite lattices
zbMATH Open document ID: 0840.06009
DOI: 10.1007/BF01110379
author: Luboš Thoma
author: Vojtěch Rödl
published in: Order
publication date: 1996-05-05T00:00:00Z
Mathematics Subject Classification ID: 06B05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 06B20
zbMATH DE Number: 852895
zbMATH Keywords: finite lattice
zbMATH Keywords: expander graph
zbMATH Keywords: decision problem
zbMATH Keywords: cover graph
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
cites work: There are infinitely many Carmichael numbers
cites work: Undirected Graphs Realizable as Graphs of Modular Lattices
cites work: Q4004078
cites work: Q5733553
cites work: On the complexity of diagram testing
cites work: Q4198056
cites work: Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
cites work: Ramanujan graphs
cites work: On the hardness of approximating minimization problems
cites work: Complexity of diagrams
cites work: Q3291034
cites work: Q3222890
cites work: Edge disjoint placement of graphs
full work available at URL: https://doi.org/10.1007/bf01110379
OpenAlex ID: W410947548
description: scientific article; zbMATH DE number 852895