Pages that link to "Item:Q5069984"

The following pages link to (2,1)-total labelling of planar graphs with large maximum degree (Q5069984):

Displaying 9 items.

• A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562) (← links)
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable (Q2115229) (← links)
• On \((p, 1)\)-total labelling of some 1-planar graphs (Q2227112) (← links)
• On \((p, 1)\)-total labelling of NIC-planar graphs (Q2239035) (← links)
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) (← links)
• (Q3570849) (← links)
• (Q5081905) (← links)
• Two results on K-(2,1)-total choosability of planar graphs (Q5859491) (← links)
• On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs (Q6117322) (← links)