On characterizing radio k-coloring problem by path covering problem

DOI10.1016/J.DISC.2014.11.014MaRDI QIDQ488288zbMATH OpenOpenAlexFDO

Authors Ushnish Sarkar, Avishek Adhikari

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

Hamiltonian pathcirculant graphradio \(k\)-coloringpath covering number

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7725444
• Radio k-colorings of paths
• Upper bound for radio \(k\)-chromatic number of graphs in connection with partition of vertex set
• Radio \(k\)-labeling of paths
• A new graph radio \(k\)-coloring algorithm

Cites work

• 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 2154968 (Why is no real title available?)
• scientific article; zbMATH DE number 2170463 (Why is no real title available?)
• A note on Hamiltonian circuits
• A note on radio antipodal colourings of paths.
• Antipodal number of some powers of cycles
• Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
• 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
• Nearly antipodal chromatic number \(ac'(P_n)\) of the path \(P_n\).
• On Path Cover Problems in Digraphs and Applications to Program Testing
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• Optimal covering of cacti by vertex-disjoint paths
• Optimal radio labellings of complete m-ary trees
• 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

(13)

• On radio connection number of graphs
• scientific article; zbMATH DE number 1819633 (Why is no real title available?)
• A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number
• On radio \(k\)-labeling of the power of the infinite path
• Antipodal radio labelling of full binary trees
• scientific article; zbMATH DE number 7725444 (Why is no real title available?)
• Hole: An Emerging Character in the Story of Radio k-Coloring Problem
• Radio k-colorings of paths
• Triameter of graphs
• More relations between \(\lambda \)-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
• Radio \(k\)-chromatic number of cycles for large \(k\)
• Antipodal number of full \(m\)-ary trees
• Radio \(k\)-labeling of paths

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

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