Font Size:
a
A
A
Keyword [channel assignment problem]
Result: 1 - 9 | Page: 1 of 1
1.
The Vertex Labeling On Graphs
2.
The Edge Span Of L(d,1)-labeling On Some Graphs
3.
L(2, 1)-labeling Of 3-regular Graphs With Perfect Matching And The Optimal Labeling Of Caterpillar
4.
The Circular Labeling Of Graphs
5.
Full-colorable Graphs And Optimal Label
6.
L(2,1)-Edge-Labeling Of Graphs
7.
L(2, 1)-Labelings Of Composite Graphs
8.
Relaxed Distance Two Labelings Of Graphs
9.
Some properties of L(2,1)-coloring as related to the channel assignment problem
<<First
<Prev Next>
Last>>
Jump to
