A linear time algorithm to compute square of interval graphs and their colouring
The square of a graph G=(V,E), denoted by G2, is a graph on the same vertex set V(G) such that two vertices x and y are adjacent in G2 if and only if there is a path of length one or two between x and y in G. In this article, a new linear time algorithm is presented to compute G2 from G when G is an...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2016-04-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860015300335 |