List (d,1)-total labelling of graphs embedded in surfaces
Yong Yu, Xin Zhang, Guizhen Liu

TL;DR
This paper investigates the list (d,1)-total labelling of graphs embedded in surfaces, establishing an upper bound on the (d,1)-total choosability for graphs with large maximum degree.
Contribution
It extends the concept of (d,1)-total labelling to the list version for embedded graphs and provides an upper bound on the choosability based on maximum degree.
Findings
Proves an upper bound of Δ(G)+2d for (d,1)-total choosability.
Applies to graphs embedded in surfaces with large maximum degree.
Extends previous labelling results to the list setting.
Abstract
The (d,1)-total labelling of graphs was introduced by Havet and Yu. In this paper, we consider the list version of (d,1)-total labelling of graphs. Let G be a graph embedded in a surface with Euler characteristic whose maximum degree is sufficiently large. We prove that the (d,1)-total choosability of is at most .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Digital Image Processing Techniques · Advanced Graph Theory Research
