Graph covers: where topology meets computer science, and simple means difficult
From MaRDI portal
Publication:6070783
DOI10.1007/978-3-031-27051-2_1MaRDI QIDQ6070783
No author found.
Publication date: 24 November 2023
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- 20 years of Negami's planar cover conjecture
- A complete complexity classification of the role assignment problem
- On the complexity of H-coloring
- Coverings and minors: Application to local computations in graphs
- Covering regular graphs
- List homomorphisms and circular arc graphs
- Computational complexity of covering disconnected multigraphs
- List covering of regular multigraphs
- A linear time algorithm for \(L(2,1)\)-labeling of trees
- Graph labelings derived from models in distributed computing: A complete complexity classification
- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
- Labelling Graphs with a Condition at Distance 2
- The $L(2,1)$-Labeling Problem on Graphs
- Fixed-parameter complexity of \(\lambda\)-labelings
