Pages that link to "Item:Q1680868"
From MaRDI portal
The following pages link to \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs (Q1680868):
Displaying 12 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(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs (Q1680868) (← links)
- Distance two surjective labelling of paths and interval graphs (Q2045355) (← links)
- On \(\text{Ł}(\wp, \wp - 1, \dots, 1)\) labelings of circulant graphs (Q2051682) (← links)
- A note on distance-\(k\) labeling and \(k\)th powers of graphs (Q2718336) (← links)
- L(3,2,1)-Labeling problems on trapezoid graphs (Q5025142) (← links)
- L(2,1,1)-labeling of interval graphs (Q6107729) (← links)
- (Q6184161) (← links)
- \(L(3, 2, 1)\)-labeling problem of square of path (Q6545051) (← links)
- Minimization of span in \(L(3,1)\)-labeling for a particular type of intersection graphs (Q6608601) (← links)
- \(L(3, 2, 1)\)-labeling of certain planar graphs (Q6646440) (← links)
