Pages that link to "Item:Q1043541"

The following pages link to On \((d,1)\)-total numbers of graphs (Q1043541):

Displaying 15 items.

• The \((p,q)\)-total labeling problem for trees (Q408175) (← 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)
• New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q533885) (← links)
• The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs (Q548395) (← 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)
• The \((d, 1)\)-total labelling of Sierpiński-like graphs (Q2279623) (← 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)
• \( 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)
• (2,1)-total labelling of planar graphs with large maximum degree (Q5069984) (← links)
• (Q5206404) (← links)
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659) (← links)