\((2,1)\)-Total number of trees with maximum degree three
type: Item
instance of: scholarly article
title: \((2,1)\)-Total number of trees with maximum degree three
zbMATH Open document ID: 1209.68386
author: Weifan Wang
author: D. Chen
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 5773802
zbMATH Keywords: combinatorial problems
zbMATH Keywords: maximum degree
zbMATH Keywords: \((2, 1)\)-total number of trees with \(\Delta = 3\)
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.03.027
OpenAlex ID: W1995823878
cites work: \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
cites work: The $L(2,1)$-Labeling Problem on Graphs
cites work: \((2,1)\)-total labelling of outerplanar graphs
cites work: Q5492304
cites work: Labelling Graphs with a Condition at Distance 2
cites work: \((p,1)\)-total labelling of graphs
cites work: (2,1)-total labelling of trees with sparse vertices of maximum degree
cites work: $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
cites work: \([r,s,t]\)-colorings of graphs
cites work: On \((d,1)\)-total numbers of graphs
cites work: A bound on the chromatic number of the square of a planar graph
cites work: (d,1)-total labeling of graphs with a given maximum average degree
cites work: Labeling Planar Graphs with Conditions on Girth and Distance Two
cites work: The \(L(2,1)\)-labelling of trees
cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs
DOI: 10.1016/J.IPL.2009.03.027
description: scientific article; zbMATH DE number 5773802