Hole: An Emerging Character in the Story of Radio k-Coloring Problem

DOI10.1007/978-981-10-5370-2_1zbMath1402.90033OpenAlexW2773063264MaRDI QIDQ4555205

Avishek Adhikari, Ushnish Sarkar

Publication date: 19 November 2018

Published in: Mathematical and Statistical Applications in Life Sciences and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-10-5370-2_1

zbMATH Keywords

cellular networkgraph-theoretic approachradio networks\(k\)-coloring problemfrequency assignment problem (FAP)

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Antipodal number of some powers of cycles
• On characterizing radio \(k\)-coloring problem by path covering problem
• A lower bound for radio \(k\)-chromatic number
• A survey on radio \(k\)-colorings of graphs
• Linear algorithm for optimal path cover problem on interval graphs
• On island sequences of labelings with a condition at distance two
• Optimal radio labellings of complete \(m\)-ary trees
• Optimal covering of cacti by vertex-disjoint paths
• Relating path coverings to vertex labellings with a condition at distance two
• No-hole \(L(2,1)\)-colorings
• A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number
• Extremal problems on consecutive \(L(2,1)\)-labelling
• An extremal problem on non-full colorable graphs
• Path covering number and \(L(2,1)\)-labeling number of graphs
• On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs
• Radio number for trees
• A survey on labeling graphs with a condition at distance two
• A note on Hamiltonian circuits
• Full Color Theorems for L(2,1)-Colorings
• Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
• Radio k-labelings for Cartesian products of graphs
• Labelling Graphs with a Condition at Distance 2
• Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
• On Path Cover Problems in Digraphs and Applications to Program Testing
• The $L(2,1)$-Labeling Problem on Graphs
• On the Structure of Graphs with Non-Surjective L(2,1)-Labelings
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: Hole: An Emerging Character in the Story of Radio k-Coloring Problem