\(L(0,1)\)-labelling of permutation graphs (Q894561): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An efficient algorithm to find next-to-shortest path on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for  -Colorings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(h,1)\)-labeling subclasses of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-two labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(L(p,1)\)-labelling of graphs / 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: Bipartite permutation graphs with application to the minimum buffer size problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm to generate all maximal independent sets on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4614841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labeling of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight<i>k</i>-independent set problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient PRAM algorithm for maximum-weight independent set on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling of some planar graphs with a condition at distance two / rank
 
Normal rank

Revision as of 03:08, 11 July 2024

scientific article
Language Label Description Also known as
English
\(L(0,1)\)-labelling of permutation graphs
scientific article

    Statements

    \(L(0,1)\)-labelling of permutation graphs (English)
    0 references
    0 references
    0 references
    0 references
    1 December 2015
    0 references
    frequency assignment problem
    0 references
    \(L(0,1)\)-labelling
    0 references
    permutation graph
    0 references

    Identifiers