The k-metric colorings of a graph.

DOI10.21136/MB.2012.142787MaRDI QIDQ2897337zbMATH OpenOpenAlexFDO

Authors Futaba Fujie-Okamoto, Willem Renzema, Ping Zhang

Publication date 10 July 2012

Published in Mathematica Bohemica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/246364, http://mb.math.cas.cz/mb137-1/

zbMATH Keywords

detour distancemetric chromatic numbermetric coloring

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1990676
• Antipodal number of some powers of cycles
• Hamiltonian colorings of graphs
• On Hamiltonian colorings and hc-stable graphs
• On Hamiltonian colorings for some graphs

Cited in

(1)

• The metric chromatic number of a graph

This page was built for publication: The \(k\)-metric colorings of a graph.

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