scientific article; zbMATH DE number 7543997

DOI10.3770/j.issn:2095-2651.2022.02.002zbMath1499.05238MaRDI QIDQ5081905

Lei Sun, Yan Song

Publication date: 17 June 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

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

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)

Cites Work

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

This page was built for publication: