scientific article
From MaRDI portal
Publication:4017175
zbMATH Open0763.05035MaRDI QIDQ4017175FDOQ4017175
James Abello, Michael R. Fellows, John Stillwell
Publication date: 16 January 1993
Title of this publication is not available (Why is that?)
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatorics on words (68R15)
Cited In (47)
- Unique square property, equitable partitions, and product-like graphs
- Locally injective \(k\)-colourings of planar graphs
- Recognizing graph products and bundles
- Title not available (Why is that?)
- Comparing Universal Covers in Polynomial Time
- Graph covers: where topology meets computer science, and simple means difficult
- Upper bounds and algorithms for parallel knock-out numbers
- On recognition of strong graph bundles
- Mike Fellows: Weaving the Web of Mathematics and Adventure
- An algorithmic framework for locally constrained homomorphisms
- Graph labelings derived from models in distributed computing: A complete complexity classification
- Combinatorics of unavoidable complexes
- Regular codes in regular graphs are difficult
- Algorithm for recognizing Cartesian graph bundles
- Covering regular graphs
- Small non-Leighton two-complexes
- Title not available (Why is that?)
- Computing role assignments of chordal graphs
- A complete complexity classification of the role assignment problem
- Computational complexity of covering disconnected multigraphs
- Comparing universal covers in polynomial time
- Locally Injective Homomorphism to the Simple Weight Graphs
- Packing bipartite graphs with covers of complete bipartite graphs
- Locally constrained graph homomorphisms and equitable partitions
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- On the Complexity of Planar Covering of Small Graphs
- Computational complexity of covering three-vertex multigraphs
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms
- 3-connected reduction for regular graph covers
- List covering of regular multigraphs
- An algorithmic framework for locally constrained homomorphisms
- Unfoldings and Coverings of Weighted Graphs
- Complexity of Locally Injective Homomorphism to the Theta Graphs
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
- Fixed-parameter complexity of \(\lambda\)-labelings
- Computational complexity of covering disconnected multigraphs
- Title not available (Why is that?)
- The combinatorics of \(\tau\)-covers
- Effective calculations of the degree of ∗-covering
- The combinatorics of Borel covers
- Covers of simplicial complexes and applications to geometry
- List covering of regular multigraphs with semi-edges
- Exact algorithm for graph homomorphism and locally injective graph homomorphism
- On the computational complexity of partial covers of theta graphs
- Title not available (Why is that?)
- Complexity of graph covering problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017175)
