\((p,1)\)-total labelling of graphs

From MaRDI portal
Publication:2467731

DOI10.1016/j.disc.2007.03.034zbMath1137.05062OpenAlexW2003367147MaRDI QIDQ2467731

Min-Li Yu, Frédéric Havet

Publication date: 28 January 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.034




Related Items (33)

A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees\((2,1)\)-total labeling of a class of subcubic graphsComputational complexity of distance edge labeling(2,1)-total labelling of planar graphs with large maximum degree\(L(2, 1)\)-labelings of the edge-path-replacement of a graph\( L ( p , q )\)-labelings of subdivisions of graphs\(L(d,1)\)-labelings of the edge-path-replacement of a graphFacial \([r,s,t\)-colorings of plane graphs] ⋮ The \((p,q)\)-total labeling problem for treesOn list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphsIrreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph\((p,q)\)-total labeling of complete graphsA tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphsOn \((p,1)\)-total labelling of 1-planar graphs\(L(2,1)\)-labelings of subdivisions of graphsOn \((p, 1)\)-total labelling of some 1-planar graphsThe (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2On \((p, 1)\)-total labelling of NIC-planar graphsOn \((p,1)\)-total labelling of planar graphsA structure of 1-planar graph and its applications to coloring problemsComplexity of (p,1)-total labellingOn irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs(2,1)-total labelling of trees with sparse vertices of maximum degreeUnnamed ItemCorrigendum to ``\((p,1)\)-total labelling of graphs [Discrete math. 308 (2008) 496-513] ⋮ \((2,1)\)-Total number of trees with maximum degree threeThe \((d, 1)\)-total labelling of Sierpiński-like graphsA sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelableGraph coloring with cardinality constraints on the neighborhoodsOn \((d,1)\)-total numbers of graphs\((2,1)\)-total labeling of trees with large maximum degree\(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs



Cites Work


This page was built for publication: \((p,1)\)-total labelling of graphs