scientific article; zbMATH DE number 91031
From MaRDI portal
Publication:4017175
Recommendations
Cited in
(49)- Algorithm for recognizing Cartesian graph bundles
- Effective calculations of the degree of ∗-covering
- The combinatorics of Borel covers
- Packing bipartite graphs with covers of complete bipartite graphs
- Covering regular graphs
- Computational complexity of covering disconnected multigraphs
- On recognition of strong graph bundles
- Computational topology and the unique games conjecture
- Unique square property, equitable partitions, and product-like graphs
- Comparing universal covers in polynomial time
- Computing role assignments of chordal graphs
- Unfoldings and Coverings of Weighted Graphs
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
- Small non-Leighton two-complexes
- Comparing Universal Covers in Polynomial Time
- Mike Fellows: Weaving the Web of Mathematics and Adventure
- Fixed-parameter complexity of \(\lambda\)-labelings
- On the computational complexity of partial covers of theta graphs
- Locally injective \(k\)-colourings of planar graphs
- Locally injective homomorphism to the simple weight graphs
- scientific article; zbMATH DE number 811561 (Why is no real title available?)
- scientific article; zbMATH DE number 4149063 (Why is no real title available?)
- Computational complexity of covering disconnected multigraphs
- Computational complexity of covering three-vertex multigraphs
- Covers of simplicial complexes and applications to geometry
- Computational complexity of covering three-vertex multigraphs
- An algorithmic framework for locally constrained homomorphisms
- The combinatorics of \(\tau\)-covers
- scientific article; zbMATH DE number 4152568 (Why is no real title available?)
- Graph labelings derived from models in distributed computing: A complete complexity classification
- Locally constrained graph homomorphisms and equitable partitions
- Regular codes in regular graphs are difficult
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms
- Complexity of locally injective homomorphism to the Theta graphs
- On the complexity of planar covering of small graphs
- Graph covers: where topology meets computer science, and simple means difficult
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- An algorithmic framework for locally constrained homomorphisms
- Upper bounds and algorithms for parallel knock-out numbers
- 3-connected reduction for regular graph covers
- Combinatorics of unavoidable complexes
- scientific article; zbMATH DE number 5792233 (Why is no real title available?)
- A complete complexity classification of the role assignment problem
- Complexity of graph covering problems
- Exact algorithm for graph homomorphism and locally injective graph homomorphism
- Recognizing graph products and bundles
- List covering of regular multigraphs with semi-edges
- List covering of regular multigraphs
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)
