On \((d,1)\)-total numbers of graphs
From MaRDI portal
Publication:1043541
DOI10.1016/j.disc.2008.10.008zbMath1208.05130OpenAlexW2065428070MaRDI QIDQ1043541
Daphne Der-Fen Liu, Ko-Wei Lih, Wei Fan Wang
Publication date: 9 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.10.008
Related Items
A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) ⋮ (2,1)-total labelling of planar graphs with large maximum degree ⋮ \( L ( p , q )\)-labelings of subdivisions of graphs ⋮ The \((p,q)\)-total labeling problem for trees ⋮ A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs ⋮ \(L(2,1)\)-labelings of subdivisions of graphs ⋮ The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 ⋮ New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs ⋮ The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs ⋮ (2,1)-total labelling of trees with sparse vertices of maximum degree ⋮ \((2,1)\)-Total number of trees with maximum degree three ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable ⋮ \((2,1)\)-total labeling of trees with large maximum degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \([r,s,t\)-colorings of graphs]
- \([r,s,t\)-chromatic numbers and hereditary properties of graphs]
- List edge and list total colourings of multigraphs
- Total colourings of graphs
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
- \((2,1)\)-total labelling of outerplanar graphs
- \((p,1)\)-total labelling of graphs
- A survey on labeling graphs with a condition at distance two
- (d,1)-total labeling of graphs with a given maximum average degree
- Labelling Graphs with a Condition at Distance 2
- On the $\lambda$-Number of $Q_n $ and Related Graphs
