On characterizing radio \(k\)-coloring problem by path covering problem

DOI10.1016/j.disc.2014.11.014zbMath1305.05082OpenAlexW2034268496MaRDI QIDQ488288

Avishek Adhikari, Ushnish Sarkar

Publication date: 23 January 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.11.014

zbMATH Keywords

path covering numberHamiltonian pathcirculant graphradio \(k\)-coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Radio k-chromatic number of cycles for large k ⋮ Triameter of graphs ⋮ Unnamed Item ⋮ Antipodal number of full \(m\)-ary trees ⋮ Radio $k$-labeling of paths ⋮ A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number ⋮ Antipodal radio labelling of full binary trees

Cites Work

• Antipodal number of some powers of cycles
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• Linear algorithm for optimal path cover problem on interval graphs
• 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
• Radio number for trees
• A note on Hamiltonian circuits
• Radio k-labelings for Cartesian products of graphs
• Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$
• 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
• Multilevel Distance Labelings for Paths and Cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On characterizing radio \(k\)-coloring problem by path covering problem