scientific article
From MaRDI portal
Publication:4017175
zbMath0763.05035MaRDI QIDQ4017175
James Abello, Michael R. Fellows, John Stillwell
Publication date: 16 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics on words (68R15) Planar graphs; geometric and topological aspects of graph theory (05C10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (34)
Algorithm for recognizing Cartesian graph bundles ⋮ Regular codes in regular graphs are difficult ⋮ Computational complexity of covering disconnected multigraphs ⋮ Mike Fellows: Weaving the Web of Mathematics and Adventure ⋮ Cantor--Bernstein type theorem for locally constrained graph homomorphisms ⋮ 3-connected reduction for regular graph covers ⋮ List covering of regular multigraphs ⋮ Covering regular graphs ⋮ Unique square property, equitable partitions, and product-like graphs ⋮ An algorithmic framework for locally constrained homomorphisms ⋮ Locally injective \(k\)-colourings of planar graphs ⋮ Graph covers: where topology meets computer science, and simple means difficult ⋮ Comparing Universal Covers in Polynomial Time ⋮ Unfoldings and Coverings of Weighted Graphs ⋮ Unnamed Item ⋮ List covering of regular multigraphs with semi-edges ⋮ Computational complexity of covering three-vertex multigraphs ⋮ Locally constrained graph homomorphisms and equitable partitions ⋮ Complexity of graph covering problems ⋮ Packing bipartite graphs with covers of complete bipartite graphs ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ Exact algorithm for graph homomorphism and locally injective graph homomorphism ⋮ Complexity of Locally Injective Homomorphism to the Theta Graphs ⋮ Locally Injective Homomorphism to the Simple Weight Graphs ⋮ On the computational complexity of partial covers of theta graphs ⋮ Computing role assignments of chordal graphs ⋮ Fixed-parameter complexity of \(\lambda\)-labelings ⋮ Comparing universal covers in polynomial time ⋮ Upper bounds and algorithms for parallel knock-out numbers ⋮ Graph labelings derived from models in distributed computing: A complete complexity classification ⋮ On the Complexity of Planar Covering of Small Graphs ⋮ Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree ⋮ Small non-Leighton two-complexes ⋮ A complete complexity classification of the role assignment problem
This page was built for publication:
