\(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11786-014-0180-2 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11786-014-0180-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139490156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling bipartite permutation graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for  -Colorings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the<i>L</i>(2, 1)-labelling of block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(L(2,1)\)-labeling of unigraphs / 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: On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of \(\lambda\)-labelings / 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: A Linear Time Algorithm for L(2,1)-Labeling of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem about the Channel Assignment Problem / 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: \(L(2,1)\)-labeling of perfect elimination bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4614841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-colorings of graphs: recent results and open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection of programme slots of television channels for giving advertisement: a graph theoretic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Chordal Graphs: Distance Two Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear structure of bipartite permutation graphs and the longest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11786-014-0180-2 / rank
 
Normal rank

Latest revision as of 19:22, 16 December 2024

scientific article
Language Label Description Also known as
English
\(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
scientific article

    Statements

    \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2015
    0 references
    \(L(2
    0 references
    1)\)-labeling
    0 references
    permutation graphs
    0 references
    bipartite permutation graphs
    0 references
    0 references
    0 references

    Identifiers