Pages that link to "Item:Q2462398"

The following pages link to \((2,1)\)-total labelling of outerplanar graphs (Q2462398):

Displaying 25 items.

• \((2,1)\)-total labeling of a class of subcubic graphs (Q324977) (← links)
• Edge coloring by total labelings of outerplanar graphs (Q381093) (← links)
• The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
• (2,1)-total number of joins of paths and cycles (Q424617) (← links)
• A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562) (← links)
• \(L(2,1)\)-labelings of subdivisions of graphs (Q472974) (← links)
• On \((p,1)\)-total labelling of planar graphs (Q512891) (← links)
• On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
• (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) (← links)
• \((2,1)\)-Total number of trees with maximum degree three (Q989489) (← links)
• Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
• On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
• The number of labeled outerplanar \(k\)-cyclic graphs (Q1668057) (← links)
• On the number of labeled outerplanar \(k\)-cycle blocks (Q1744336) (← links)
• \((p,q)\)-total labeling of complete graphs (Q1956251) (← links)
• On \((p, 1)\)-total labelling of NIC-planar graphs (Q2239035) (← links)
• \((2,1)\)-total labeling of trees with large maximum degree (Q2348054) (← links)
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) (Q2359803) (← links)
• Facial \([r,s,t]\)-colorings of plane graphs (Q2416948) (← links)
• \( L ( p , q )\)-labelings of subdivisions of graphs (Q2659077) (← links)
• The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 (Q3000498) (← links)
• (Q3051721) (← links)
• (Q3570849) (← links)
• (2,1)-total labelling of planar graphs with large maximum degree (Q5069984) (← links)
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659) (← links)