Labeling bipartite permutation graphs with a condition at distance two (Q1026125): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2009.02.004 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991411408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate <i>L</i>(δ<sub>1</sub>,δ<sub>2</sub>,…,δ<sub><i>t</i></sub>)‐coloring of trees and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel assignment for interference avoidance in honeycomb wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for  -Colorings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backbone colorings for graphs: Tree and path backbones / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda\)-coloring matrogenic 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: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect 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: Solving the weighted efficient edge domination problem on bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(L(2,1)\)-labeling on graphs and the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-path partition of graphs. / 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: Graph labeling and radio channel assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic domination on 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 / DOI
 
Property / DOI: 10.1016/J.DAM.2009.02.004 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:37, 10 December 2024

scientific article
Language Label Description Also known as
English
Labeling bipartite permutation graphs with a condition at distance two
scientific article

    Statements

    Labeling bipartite permutation graphs with a condition at distance two (English)
    0 references
    0 references
    24 June 2009
    0 references
    distance two labeling
    0 references
    \(L(p,q)\)-labeling
    0 references
    channel assignment
    0 references
    bipartite permutation graph
    0 references
    biclique
    0 references

    Identifiers