A Theorem about the Channel Assignment Problem
From MaRDI portal
Publication:4443099
DOI10.1137/S0895480101399449zbMath1029.05053WikidataQ57601596 ScholiaQ57601596MaRDI QIDQ4443099
Riste Škrekovski, Daniel Král'
Publication date: 8 January 2004
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items (50)
The List \(L(2, 1)\)-labeling of planar graphs ⋮ \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs ⋮ The 2-dipath chromatic number of Halin graphs ⋮ Some new bounds on \(T_{r}\)-choosability ⋮ \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs ⋮ The \(L(2,1)\)-labeling on planar graphs ⋮ Mixed hypergraphs and other coloring problems ⋮ Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs ⋮ Distance-two labelings of digraphs ⋮ \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles ⋮ A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\) ⋮ Backbone coloring for graphs with large girths ⋮ Some results on the injective chromatic number of graphs ⋮ On \(L(2,1)\)-labeling of generalized Petersen graphs ⋮ \(L(p,q)\)-labeling of a graph embeddable on the torus ⋮ \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ List backbone colouring of graphs ⋮ The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs ⋮ On theL(2, 1)-labelling of block graphs ⋮ Labeling planar graphs with a condition at distance two ⋮ \((2,1)\)-total labelling of outerplanar graphs ⋮ The \(L(2,1)\)-labeling on the skew and converse skew products of graphs ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ Radio number for trees ⋮ The \(L(2,1)\)-labeling on Cartesian sum of graphs ⋮ The \(L(2,1)\)-labeling on graphs and the frequency assignment problem ⋮ On the \(L(p,1)\)-labelling of graphs ⋮ Distance constrained labelings of planar graphs with no short cycles ⋮ Graph labellings with variable weights, a survey ⋮ An exact algorithm for the channel assignment problem ⋮ The \(L(2,1)\)-labelling of trees ⋮ \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs ⋮ A survey on labeling graphs with a condition at distance two ⋮ \(L(2,1)\)-labelings on the composition of \(n\) graphs ⋮ A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\) ⋮ The list \(L(2,1)\)-labeling of planar graphs with large girth ⋮ The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications ⋮ Distance two surjective labelling of paths and interval graphs ⋮ The \(L(p, q)\)-labelling of planar graphs without 4-cycles ⋮ \( L ( 2 , 1 )\)-labeling of disk intersection graphs ⋮ Some results on distance two labelling of outerplanar graphs ⋮ Radio fuzzy graphs and assignment of frequency in radio stations ⋮ Distance constrained labelings of \(K_{4}\)-minor free graphs ⋮ Optimal frequency assignment and planar list \(L(2, 1)\)-labeling ⋮ Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs ⋮ List version of \(L(d,s)\)-labelings
This page was built for publication: A Theorem about the Channel Assignment Problem
