Pages that link to "Item:Q512891"

The following pages link to On \((p,1)\)-total labelling of planar graphs (Q512891):

Displaying 18 items.

• A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562) (← links)
• On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
• The \(L(2,1)\)-labeling on planar graphs (Q868019) (← links)
• Complexity of (p,1)-total labelling (Q967327) (← links)
• \((p,q)\)-total labeling of complete graphs (Q1956251) (← links)
• A structure of 1-planar graph and its applications to coloring problems (Q2000562) (← 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)
• \((p,1)\)-total labelling of graphs (Q2467731) (← links)
• On \((p,1)\)-total labelling of special 1-planar graphs. (Q2828857) (← links)
• (Q3570849) (← links)
• The \( (2,1)\)-total labeling of planar graphs without 5-cycles and 6-cycles (Q4625643) (← links)
• Adjacency Labelling for Planar Graphs (and Beyond) (Q5056430) (← links)
• (2,1)-total labelling of planar graphs with large maximum degree (Q5069984) (← 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)