Pages that link to "Item:Q967309"
From MaRDI portal
The following pages link to Graph labellings with variable weights, a survey (Q967309):
Displaying 16 items.
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Distance three labelings of trees (Q415278) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Bounds on spectrum graph coloring (Q510538) (← links)
- On real number labelings and graph invertibility (Q713307) (← links)
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
- Labeling the \(r\)-path with a condition at distance two (Q967377) (← links)
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles (Q1631690) (← links)
- Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008) (← links)
- Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures (Q2079984) (← links)
- On a distance-constrained graph labeling to model cooperation (Q2243133) (← links)
- Contrast in greyscales of graphs (Q2307508) (← links)
- Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction (Q2420428) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- Radio $k$-labeling of paths (Q5164256) (← links)
- Minimum gradation in greyscales of graphs (Q6108924) (← links)
