The following pages link to (Q4614841):
Displaying 6 items.
- A linear time algorithm to compute square of interval graphs and their colouring (Q322053) (← links)
- \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
- \(L(0,1)\)-labelling of permutation graphs (Q894561) (← links)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
- Exact square coloring of certain classes of graphs: complexity and algorithms (Q2172606) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
