Complexity of dimension three and some related edge-covering characteristics of graphs
type: Item
instance of: scholarly article
title: Complexity of dimension three and some related edge-covering characteristics of graphs
zbMATH Open document ID: 0442.68031
DOI: 10.1016/0304-3975(80)90039-0
author: Luděk Kučera
author: J. Nešetřil
author: A. Pultr
published in: Theoretical Computer Science
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 3690685
zbMATH Keywords: edge-covering
MaRDI profile type: Publication
full work available at URL: 0304-3975(80)90039-0
OpenAlex ID: W2109635482
cites work: On the computational power of pushdown automata
cites work: The complexity of theorem-proving procedures
cites work: Partially Ordered Sets
cites work: The Complexity of Near-Optimal Graph Coloring
cites work: Some simplified NP-complete graph problems
cites work: Q4065570
cites work: Reducibility among Combinatorial Problems
cites work: On the Computational Complexity of Combinatorial Problems
cites work: Q4135599
cites work: A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
cites work: Q3291034
description: scientific article; zbMATH DE number 3690685