Channel assignment problem and relaxed 2-distant coloring of graphs
DOI10.1016/J.DAM.2019.08.028zbMath1435.05187OpenAlexW2974316668MaRDI QIDQ2306601
Publication date: 23 March 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.08.028
planar graphchannel assignment problemouterplanar graph2-distant coloring\(t\)-relaxed 2-distant coloring\(t\)-relaxed coloring
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Channel models (including quantum) in information and communication theory (94A40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \((s,t)\)-relaxed strong edge-coloring of graphs
- No-hole \((r+1)\)-distant colorings
- No-hole 2-distant colorings
- Extremal results on defective colorings of graphs
- Relaxed chromatic numbers of graphs
- Relaxed game chromatic number of graphs
- No-hole \(k\)-tuple \((r+1)\)-distant colorings
- The complexity of generalized graph colorings
- Weighted improper colouring
- Minimum Span of No-Hole (r+1)-Distant Colorings
- Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions
- Improper coloring of unit disk graphs
- Defective coloring revisited
- On the linear vertex-arboricity of a planar graph
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- A note on defective colorings of graphs in surfaces
- List Improper Colourings of Planar Graphs
- Acrylic improper colorings of graphs
- On (s,t)-relaxed L(1,1)-labelling of trees
- On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs
This page was built for publication: Channel assignment problem and relaxed 2-distant coloring of graphs
