Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
Labeling Chordal Graphs: Distance Two Condition
SIAM Journal on Discrete Mathematics
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
Graph classes: a survey
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
L(h,1)-labeling subclasses of planar graphs
Journal of Parallel and Distributed Computing
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
The Computer Journal
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Labeling bipartite permutation graphs with a condition at distance two
Discrete Applied Mathematics
A general approach to L(h,k)-label interconnection networks
Journal of Computer Science and Technology
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
The L(2,1)-labeling of unigraphs
Discrete Applied Mathematics
On n-fold L(j,k)-and circular L(j,k)-labelings of graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
This paper investigates a variant of the general problem of assigning channels to the stations of a wireless network when the graph representing the possible interferences is a matrogenic graph. In our problem, channels assigned to adjacent vertices must be at least 2 apart, while channels assigned to vertices at distance 2 must be different. An exact linear time algorithm is provided for the class of threshold graphs. For matrogenic and matroidal graphs approximate algorithms are given. Consequently, previously known results concerning subclasses of cographs, split graphs and graphs with diameter 2 are improved.