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

DOI10.1007/S10878-016-0041-9zbMATH Open1377.05070OpenAlexW2436733907MaRDI QIDQ2012891FDOQ2012891

Authors: Ushnish Sarkar, Avishek Adhikari 

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

Recommendations

• A lower bound for radio \(k\)-chromatic number of an arbitrary graph
• Upper bound for radio \(k\)-chromatic number of graphs in connection with partition of vertex set
• A new graph radio \(k\)-coloring algorithm
• Improved bounds for some of the radio \(k\)-chromatic numbers of paths
• A lower bound for radio \(k\)-chromatic number
• Radio \(k\)-chromatic number of cycles for large \(k\)
• A survey on radio \(k\)-colorings of graphs
• New parameters involving chromatic sum in a graph
• A new upper bound for the chromatic number of a graph
• New construction of graphs with high chromatic number and small clique number

zbMATH Keywords

domination numbermaximum degreeradio \(k\)-coloringholepath covering number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Full Color Theorems for L(2,1)-Colorings
• Labelling Graphs with a Condition at Distance 2
• Radio number for trees
• On the radio number of toroidal grids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A lower bound for radio \(k\)-chromatic number
• Optimal radio labellings of complete \(m\)-ary trees
• Antipodal number of some powers of cycles
• A note on radio antipodal colourings of paths.
• Radio antipodal colorings of cycles
• On characterizing radio \(k\)-coloring problem by path covering problem
• On the Structure of Graphs with Non-Surjective L(2,1)-Labelings
• On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs

Cited In (1)

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

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

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