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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Injective colouring for H-free graphs / 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: 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 14:17, 29 July 2024

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

    Statements

    Identifiers