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

DOI10.1007/978-981-10-5370-2_1MaRDI QIDQ4555205zbMATH OpenOpenAlexFDO

Authors Ushnish Sarkar, Avishek Adhikari

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

\(k\)-coloring problemcellular networkfrequency assignment problem (FAP)graph-theoretic approachradio networks

Mathematics Subject Classification ID

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

Recommendations

• On characterizing radio k-coloring problem by path covering problem
• scientific article; zbMATH DE number 1953160
• A new graph radio k-coloring algorithm
• A lower bound technique for radio k-coloring
• A graph radio k-coloring algorithm
• A survey on radio \(k\)-colorings of graphs
• Radio k-colorings of paths
• Holes in L(2,1)-coloring on certain classes of graphs
• Radiocoloring in planar graphs: Complexity and approximations
• scientific article; zbMATH DE number 7725444

Cites work

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

Cited in

(1)

• A note on obtaining bipartite radio graceful graphs of arbitrarily large radio numbers with radio graceful complements

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4555205)