On a labeling problem in graphs
type: Item
instance of: scholarly article
title: On a labeling problem in graphs
zbMATH Open document ID: 1223.05259
author: Yong-Cai Geng
author: Sumit K. Garg
published in: Discrete Applied Mathematics
publication date: 2011-05-17T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 5895535
zbMATH Keywords: graph algorithms
zbMATH Keywords: software programming
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: j.dam.2010.12.022
OpenAlex ID: W2004981790
cites work: Packing and covering a tree by subtrees
cites work: Q5315023
cites work: Q4198056
cites work: Q4083452
cites work: A Linear Tree Partitioning Algorithm
cites work: Q4708473
DOI: 10.1016/J.DAM.2010.12.022
Recommended article: Q5284572
Recommended article: A result on graph labelling
Recommended article: Some open problems on graph labelings
Recommended article: The $L(2,1)$-Labeling Problem on Graphs
Recommended article: A note on labelings of graphs
Recommended article: A note on labeling of graphs
Recommended article: A study of graph labeling on a class of graphs
Recommended article: Q3803160
Recommended article: Q3441561
description: scientific article; zbMATH DE number 5895535