\(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
From MaRDI portal
Publication:2018666
DOI10.1007/s11786-014-0180-2zbMath1310.05204OpenAlexW2139490156MaRDI QIDQ2018666
Satyabrata Paul, Madhumangal Pal, Anita Pal
Publication date: 25 March 2015
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-014-0180-2
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
\(L(0,1)\)-labelling of permutation graphs, L(2,1,1)-labeling of interval graphs, Characterization of 2-path signed network, \(L(2,1)\)-labeling of interval graphs, Distance two surjective labelling of paths and interval graphs, DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE, L(3,2,1)-Labeling problems on trapezoid graphs
Cites Work
- Unnamed Item
- Unnamed Item
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs
- Bipartite permutation graphs with application to the minimum buffer size problem
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
- Labeling bipartite permutation graphs with a condition at distance two
- Bipartite permutation graphs
- \(T\)-colorings of graphs: recent results and open problems
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- \(L(h,1)\)-labeling subclasses of planar graphs
- Algorithmic graph theory and perfect graphs
- The \(L(2,1)\)-labeling of unigraphs
- Linear structure of bipartite permutation graphs and the longest path problem
- On the \(L(p,1)\)-labelling of graphs
- A survey on labeling graphs with a condition at distance two
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- A Linear Recognition Algorithm for Cographs
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- Approximations for -Colorings of Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- On theL(2, 1)-labelling of block graphs
- Fixed-parameter complexity of \(\lambda\)-labelings
