\(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
type: Item
instance of: scholarly article
title: \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
zbMATH Open document ID: 1310.05204
author: Satyabrata Paul
author: Madhumangal Pal
author: Anita Pal
published in: Mathematics in Computer Science
publication date: 2015-03-25T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6419301
zbMATH Keywords: \(L(2
zbMATH Keywords: 1)\)-labeling
zbMATH Keywords: permutation graphs
zbMATH Keywords: bipartite permutation graphs
MaRDI profile type: Publication
full work available at URL: s11786-014-0180-2
OpenAlex ID: W2139490156
cites work: Labeling bipartite permutation graphs with a condition at distance two
cites work: Approximations for -Colorings of Graphs
cites work: On theL(2, 1)-labelling of block graphs
cites work: On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
cites work: The \(L(2,1)\)-labeling of unigraphs
cites work: \(L(h,1)\)-labeling subclasses of planar graphs
cites work: On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
cites work: The $L(2,1)$-Labeling Problem on Graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Fixed-parameter complexity of \(\lambda\)-labelings
cites work: Algorithmic graph theory and perfect graphs
cites work: On the \(L(p,1)\)-labelling of graphs
cites work: Labelling Graphs with a Condition at Distance 2
cites work: A Linear Time Algorithm for L(2,1)-Labeling of Trees
cites work: Q3579493
cites work: A Theorem about the Channel Assignment Problem
cites work: Bipartite permutation graphs with application to the minimum buffer size problem
cites work: \(L(2,1)\)-labeling of perfect elimination bipartite graphs
cites work: Bipartite permutation graphs
cites work: Q4614841
cites work: \(T\)-colorings of graphs: recent results and open problems
cites work: Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
cites work: Labeling Chordal Graphs: Distance Two Condition
cites work: Linear structure of bipartite permutation graphs and the longest path problem
cites work: A survey on labeling graphs with a condition at distance two
DOI: 10.1007/S11786-014-0180-2
Recommended article: Q5017473
Recommended article: \(L(0,1)\)-labelling of permutation graphs
Recommended article: \(L(2,1)\)-labeling of perfect elimination bipartite graphs
Recommended article: Q3097326
Recommended article: Labeling bipartite permutation graphs with a condition at distance two
Recommended article: Q3404791
Recommended article: Q3009237
Recommended article: Q4468997
Recommended article: \(L(2,1)\)-labelings on the composition of \(n\) graphs
Recommended article: \(L(2, 1)\)-labeling of circulant graphs
description: scientific article; zbMATH DE number 6419301