On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs
From MaRDI portal
Publication:6117322
DOI10.1007/s10878-024-01111-3MaRDI QIDQ6117322
Guanglong Yu, Lin Sun, Jian Liang Wu
Publication date: 20 March 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
planar graphcombinatorial Nullstellensatzdischarging method1-planar graphlist \((p, 1)\)-total labelling
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Mathematical programming (90Cxx)
Cites Work
- Unnamed Item
- Unnamed Item
- On \((p,1)\)-total labelling of planar graphs
- On two generalizations of the Alon-Tarsi polynomial method
- On \((p,1)\)-total labelling of 1-planar graphs
- \(L(p, q)\)-labeling of planar graphs with small girth
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Colorings and orientations of graphs
- List \(T\)-colorings of graphs
- \(T\)-choosability in graphs
- The List \(L(2, 1)\)-labeling of planar graphs
- The number of edge 3-colorings of a planar cubic graph as a permanent
- On edge colorings of \(1\)-planar graphs
- A structure of 1-planar graph and its applications to coloring problems
- On \((p, 1)\)-total labelling of some 1-planar graphs
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
- Ein Sechsfarbenproblem auf der Kugel
- \((p,1)\)-total labelling of graphs
- (2,1)-total labelling of planar graphs with large maximum degree
This page was built for publication: On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs