The complexity of \(L(p, q)\)-edge-labelling
From MaRDI portal
Publication:2154095
DOI10.1007/978-3-030-96731-4_15OpenAlexW3081102228MaRDI QIDQ2154095
Daniël Paulusma, Gaétan Berthe, Barnaby Martin, Siani Smith
Publication date: 13 July 2022
Full work available at URL: https://arxiv.org/abs/2008.12226
Related Items
Cites Work
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
- On the computational complexity of strong edge coloring
- Computational complexity of distance edge labeling
- On the injective chromatic number of graphs
- Injective colouring for H-free graphs
- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
- The NP-Completeness of Edge-Coloring
- Labelling Graphs with a Condition at Distance 2
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- The complexity of satisfiability problems
- Acyclic, star, and injective colouring: bounding the diameter
- Fixed-parameter complexity of \(\lambda\)-labelings