A result on K-(2,1)-total choosability of planar graphs

DOI10.3770/J.ISSN:2095-2651.2022.02.002MaRDI QIDQ5081905zbMATH OpenFDO

Authors Yan Song, Lei Sun

Publication date 17 June 2022

Full work available at URL https://doi.org/10.3770/J.ISSN:2095-2651.2022.02.002

zbMATH Keywords

\(k\)-\((2,1)\)-total choosable\(L\)-\((2,1)\)-total labelingplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Two results on \(k\)-\((2,1)\)-total choosability of planar graphs
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
• Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
• On the total choosability of planar graphs and of sparse graphs
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24

Cites work

• (2,1)-total labelling of planar graphs with large maximum degree
• \((p,1)\)-total labelling of graphs
• \([r,s,t]\)-colorings of graphs
• A note on the minimum number of choosability of planar graphs
• Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
• Graph theory with applications
• List (d,1)-total labelling of graphs embedded in surfaces
• List edge and list total coloring of 1-planar graphs
• List edge and list total colorings of planar graphs without non-induced 7-cycles
• List edge and list total colourings of multigraphs
• On \((p, 1)\)-total labelling of some 1-planar graphs
• On \((p,1)\)-total labelling of planar graphs
• On (p,1)-total labelling of plane graphs with independent crossings
• Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable
• The List L(2, 1)-labeling of planar graphs
• Two results on \(k\)-\((2,1)\)-total choosability of planar graphs

Cited in

(3)

• 2-distance choosability of planar graphs with a restriction for maximum degree
• The L (2,1)-choosability of cycle
• Two results on \(k\)-\((2,1)\)-total choosability of planar graphs

This page was built for publication: A result on \(K\)-\((2,1)\)-total choosability of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5081905)