A linear time algorithm to compute square of interval graphs and their colouring

DOI10.1016/j.akcej.2016.02.007zbMath1346.05255OpenAlexW2331197208MaRDI QIDQ322053

Anita Pal, Madhumangal Pal, Satyabrata Paul

Publication date: 14 October 2016

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2016.02.007

zbMATH Keywords

cliqueinterval graph\(L(1, 1)\)-labellingsquare of graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

\(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(L(2,1)\)-labeling of interval graphs
• Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
• An optimal greedy heuristic to color interval graphs
• \(T\)-colorings of graphs: recent results and open problems
• An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
• Algorithmic graph theory and perfect graphs
• The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
• A sequential algorithm for finding a maximum weightK-independent set on interval graphs
• Labelling Graphs with a Condition at Distance 2
• An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
• An optimal parallel algorithm to construct a tree 3-spanner on interval graphs

This page was built for publication: A linear time algorithm to compute square of interval graphs and their colouring