The complexity of \(L(p, q)\)-edge-labelling (Q6090539): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of \(L(p, q)\)-edge-labelling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Injective colouring for H-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic, star, and injective colouring: bounding the diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of \(\lambda\)-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the injective chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of distance edge labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of strong edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal approximation of sparse hessians and its equivalence to a graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Latest revision as of 10:23, 19 August 2024

scientific article; zbMATH DE number 7767695
Language Label Description Also known as
English
The complexity of \(L(p, q)\)-edge-labelling
scientific article; zbMATH DE number 7767695

    Statements

    The complexity of \(L(p, q)\)-edge-labelling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2023
    0 references
    \(L(p, q)\)-labeling
    0 references
    colouring
    0 references
    dichotomy
    0 references
    computational complexity
    0 references
    NP-hard
    0 references

    Identifiers