Pages that link to "Item:Q500005"
From MaRDI portal
The following pages link to \(L(2,1)\)-labeling of interval graphs (Q500005):
Displaying 15 items.
- A linear time algorithm to compute square of interval graphs and their colouring (Q322053) (← links)
- On distance two labelling of unit interval graphs (Q730650) (← links)
- \(L(p,q)\)-label coloring problem with application to channel allocation (Q778676) (← links)
- \(L(0,1)\)-labelling of permutation graphs (Q894561) (← 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)
- Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures (Q2079984) (← links)
- The \(L(2,1)\)-labeling of unigraphs (Q2275923) (← links)
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
- \(L(2,1)\)-labeling of block graphs. (Q2804782) (← links)
- L(3,2,1)-Labeling problems on trapezoid graphs (Q5025142) (← links)
- An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs (Q6069154) (← links)
- L(2,1,1)-labeling of interval graphs (Q6107729) (← links)
- \(L(3, 2, 1)\)-labeling problem of square of path (Q6545051) (← links)
- The radio \(k\)-chromatic number for the corona of arbitrary graph and \(K_1\) (Q6629111) (← links)
