On characterizing radio k-coloring problem by path covering problem

DOI10.1016/J.DISC.2014.11.014zbMATH Open1305.05082OpenAlexW2034268496MaRDI QIDQ488288FDOQ488288

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

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

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)

Cites Work

• Title not available (Why is that?)
• On Path Cover Problems in Digraphs and Applications to Program Testing
• Linear algorithm for optimal path cover problem on interval graphs
• Relating path coverings to vertex labellings with a condition at distance two
• A note on Hamiltonian circuits
• Labelling Graphs with a Condition at Distance 2
• Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
• The $L(2,1)$-Labeling Problem on Graphs
• Radio number for trees
• Radio labelings of graphs
• Title not available (Why is that?)
• Radio k-labelings for Cartesian products of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multilevel Distance Labelings for Paths and Cycles
• Optimal radio labellings of complete \(m\)-ary trees
• Antipodal number of some powers of cycles
• Optimal covering of cacti by vertex-disjoint paths
• A note on radio antipodal colourings of paths.
• Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• Radio antipodal colorings of cycles

Cited In (12)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Radio k-chromatic number of cycles for large k
• Radio $k$-labeling of paths
• Hole: An Emerging Character in the Story of Radio k-Coloring Problem
• Radio k-colorings of paths
• Triameter of graphs
• Antipodal number of full \(m\)-ary trees

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)