\(T\)-graphs and the channel assignment problem (Q1356423): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3322121 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5286940 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3340907 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The channel assignment problem for mutually adjacent sites / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(T\)-colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4863459 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Asymptotic Approach to the Channel Assignment Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Further Results on T-Coloring and Frequency Assignment Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(T\)-colorings of graphs: recent results and open problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: List \(T\)-colorings of graphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(95)00225-l / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2091894611 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:54, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(T\)-graphs and the channel assignment problem |
scientific article |
Statements
\(T\)-graphs and the channel assignment problem (English)
0 references
11 September 1997
0 references
channel assignment problem
0 references
span
0 references
\(T\)-colorings
0 references
\(T\)-graphs
0 references