Corrigendum to ``The complexity of cubical graphs

DOI10.1016/0890-5401(89)90006-0zbMath0683.68057OpenAlexW4206111150MaRDI QIDQ1825039

Christos H. Papadimitriou, George Papageorgiou, Foto N. Afrati

Publication date: 1989

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(89)90006-0

zbMATH Keywords

embeddingdimensionedge coloringNP-completesubgraph of a hypercube

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Representation of finite graphs as difference graphs of \(S\)-units. I

Cites Work

• Unnamed Item
• The complexity of cubical graphs
• The complexity of restricted spanning tree problems

This page was built for publication: Corrigendum to ``The complexity of cubical graphs