Pages that link to "Item:Q450562"

The following pages link to A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562):

Displaying 10 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)
• On the number of labeled outerplanar \(k\)-cycle blocks (Q1744336) (← 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)
• \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
• The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 (Q3000498) (← links)
• (Q3051721) (← links)
• (Q3570849) (← links)