L(0,1)-labelling of permutation graphs
From MaRDI portal
Publication:894561
DOI10.1007/S10852-015-9280-5zbMATH Open1326.05135OpenAlexW1989068151MaRDI QIDQ894561FDOQ894561
Satyabrata Paul, Anita Pal, Madhumangal Pal
Publication date: 1 December 2015
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-015-9280-5
Recommendations
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- The \(L(3, 2, 1)\)-labelings of bipartite permutation graphs
- An efficient algorithm to solve \(L(0,1)\)-labelling problem on interval graphs
- Labeling bipartite permutation graphs with a condition at distance two
- On the \(L(p,1)\)-labelling of graphs
Cites Work
- Algorithmic graph theory and perfect graphs
- Labelling Graphs with a Condition at Distance 2
- Bipartite permutation graphs
- A survey on labeling graphs with a condition at distance two
- \(L(h,1)\)-labeling subclasses of planar graphs
- Approximations for -Colorings of Graphs
- Bipartite permutation graphs with application to the minimum buffer size problem
- Title not available (Why is that?)
- \(L(2,1)\)-labeling of interval graphs
- On the \(L(p,1)\)-labelling of graphs
- An efficient algorithm to find next-to-shortest path on permutation graphs
- Maximum weightk-independent set problem on permutation graphs
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- Title not available (Why is that?)
- An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs
- Distance-two labelings of graphs
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs
- A parallel algorithm to generate all maximal independent sets on permutation graphs
- Labelling of some planar graphs with a condition at distance two
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
- Title not available (Why is that?)
Cited In (6)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- Minimization of span in \(L(3,1)\)-labeling for a particular type of intersection graphs
- Distance two surjective labelling of paths and interval graphs
- L(2,1,1)-labeling of interval graphs
- L(3,2,1)-Labeling problems on trapezoid graphs
- \(L(3, 2, 1)\)-labeling problem of square of path
This page was built for publication: \(L(0,1)\)-labelling of permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894561)
