A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number

DOI10.1007/s10878-016-0041-9zbMath1377.05070OpenAlexW2436733907MaRDI QIDQ2012891

Avishek Adhikari, Ushnish Sarkar

Publication date: 3 August 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0041-9

zbMATH Keywords

holepath covering numberdomination numbermaximum degreeradio \(k\)-coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

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

Cites Work

• 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
• Optimal radio labellings of complete \(m\)-ary trees
• On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs
• Radio number for trees
• Full Color Theorems for L(2,1)-Colorings
• Labelling Graphs with a Condition at Distance 2
• On the Structure of Graphs with Non-Surjective L(2,1)-Labelings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number