Nearly antipodal chromatic number ac'(P_n) of the path P_n.

DOI10.21136/MB.2009.140642zbMATH Open1212.05236OpenAlexW2726943575MaRDI QIDQ3588862FDOQ3588862

Authors: Srinivasa Rao Kola, Pratima Panigrahi 

Publication date: 10 September 2010

Full work available at URL: https://eudml.org/doc/38075

Recommendations

• Nearly antipodal chromatc number of even paths.
• Improved upper bounds for nearly antipodal chromatic number of paths
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• A note on radio antipodal colourings of paths.
• Improved bounds for some of the radio \(k\)-chromatic numbers of paths

zbMATH Keywords

spanradio \(k\)-chromatic numberradio \(k\)-coloring

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (15)

• Improved upper bounds for nearly antipodal chromatic number of paths
• Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)
• Nearly antipodal chromatc number of even paths.
• A note on radio antipodal colourings of paths.
• A linear algorithm for radio \(k\)-coloring powers of paths having small diameter
• Title not available (Why is that?)
• A linear algorithm for radio \(k\)-coloring of powers of paths having small diameters
• A lower bound for radio \(k\)-chromatic number
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• Antipodal number of some powers of cycles
• On characterizing radio \(k\)-coloring problem by path covering problem
• Radio \(k\)-chromatic number of cycles for large \(k\)
• A lower bound technique for radio \(k\)-coloring
• A different approach for multi-level distance labellings of path structure networks
• Radio \(k\)-labeling of paths

This page was built for publication: Nearly antipodal chromatic number \(ac'(P_n)\) of the path \(P_n\).

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