L(2, 1)-labeling of permutation and bipartite permutation graphs
From MaRDI portal
(Redirected from Publication:2018666)
\(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
\(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
Recommendations
- The \(L(3, 2, 1)\)-labelings of bipartite permutation graphs
- L(0,1)-labelling of permutation graphs
- L(2,1)-labeling of perfect elimination bipartite graphs
- scientific article; zbMATH DE number 5972537
- Labeling bipartite permutation graphs with a condition at distance two
- The \(L(3,2,1)\)-labeling on bipartite graphs
- The \(L(2,1)\)-labeling on total graphs of complete multipartite graphs
- scientific article; zbMATH DE number 2073985
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
- \(L(2, 1)\)-labeling of circulant graphs
Cites work
- scientific article; zbMATH DE number 5764899 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- A Theorem about the Channel Assignment Problem
- A survey on labeling graphs with a condition at distance two
- Algorithmic graph theory and perfect graphs
- An efficient algorithm to solve \(L(0,1)\)-labelling problem on interval graphs
- Approximations for -Colorings of Graphs
- Bipartite permutation graphs
- Bipartite permutation graphs with application to the minimum buffer size problem
- Fixed-parameter complexity of \(\lambda\)-labelings
- Labeling Chordal Graphs: Distance Two Condition
- Labeling bipartite permutation graphs with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- Linear structure of bipartite permutation graphs and the longest path problem
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- On the \(L(2, 1)\)-labelling of block graphs
- On the \(L(p,1)\)-labelling of graphs
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
- The $L(2,1)$-Labeling Problem on Graphs
- The \(L(2,1)\)-labeling of unigraphs
- L(2,1)-labeling of perfect elimination bipartite graphs
- \(L(h,1)\)-labeling subclasses of planar graphs
- \(T\)-colorings of graphs: recent results and open problems
Cited in
(16)- The k-way vertex cut problem on bipartite graphs: complexity results and algorithms
- Characterization of 2-path signed network
- Labeling bipartite permutation graphs with a condition at distance two
- L(p,q)-labeling of graphs with interval representations
- On \(L(2,1)\)-coloring split permutation graphs
- \(L(3,2,1)\)-labeling problems on trapezoid graphs
- The \(L(3, 2, 1)\)-labelings of bipartite permutation graphs
- Distance two labeling on the square of a cycle
- L(2,1)-labeling of perfect elimination bipartite 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)-labeling of interval graphs
- L(0,1)-labelling of permutation graphs
- The radio \(k\)-chromatic number for the corona of arbitrary graph and \(K_1\)
- L(2,1,1)-labeling of interval graphs
- \(L(3, 2, 1)\)-labeling problem of square of path
This page was built for publication: \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018666)
