scientific article; zbMATH DE number 6103849
From MaRDI portal
Publication:4648329
zbMath1252.05057MaRDI QIDQ4648329
Asmiati, Djoko Suprijanto, Hilda Assiyatun, Rinovia Simanjuntak, Edy Tri Baskoro, S. Uttunggadewa
Publication date: 9 November 2012
Full work available at URL: http://www.pphmj.com/abstract/6555.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (6)
On the metric dimension of circulant and Harary graphs ⋮ The locating chromatic number for m-shadow of a connected graph ⋮ Improved algorithm for the locating-chromatic number of trees ⋮ On the locating chromatic number of certain barbell graphs ⋮ Upper bounds on the locating chromatic number of trees ⋮ Calculating an upper bound of the locating-chromatic number of trees
This page was built for publication: