The complexity of L(p, q)-edge-labelling

DOI10.1007/978-3-030-96731-4_15MaRDI QIDQ2154095zbMATH OpenOpenAlexFDO

Authors Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith

Publication date 13 July 2022

Full work available at URL https://arxiv.org/abs/2008.12226

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Acyclic, star, and injective colouring: bounding the diameter
• Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
• Fixed-parameter complexity of \(\lambda\)-labelings
• Injective colouring for H-free graphs
• Labelling Graphs with a Condition at Distance 2
• On the computational complexity of strong edge coloring
• On the injective chromatic number of graphs
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• The complexity of satisfiability problems
• The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree
• The NP-Completeness of Edge-Coloring

Cited in

(3)

• A probabilistic upper bound for the edge identification complexity of graphs
• Computing L(p,1)-Labeling with Combined Parameters
• The complexity of L(p, q)-edge-labelling

This page was built for publication: The complexity of \(L(p, q)\)-edge-labelling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154095)