Pages that link to "Item:Q3376692"
From MaRDI portal
The following pages link to (d,1)-total labeling of graphs with a given maximum average degree (Q3376692):
Displaying 27 items.
- \((2,1)\)-total labeling of a class of subcubic graphs (Q324977) (← links)
- On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
- The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
- On backbone coloring of graphs (Q434190) (← 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)
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree (Q987498) (← links)
- \((2,1)\)-Total number of trees with maximum degree three (Q989489) (← links)
- On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
- \((p,q)\)-total labeling of complete graphs (Q1956251) (← links)
- On \((p, 1)\)-total labelling of some 1-planar graphs (Q2227112) (← 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)
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) (← links)
- Backbone coloring for triangle-free planar graphs (Q2401793) (← links)
- \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
- \( L ( p , q )\)-labelings of subdivisions of graphs (Q2659077) (← links)
- The \((d,1)\)-total labelling of the cube of cycles (Q2824284) (← links)
- List \((d,1)\)-total labelling of graphs embedded in surfaces (Q2887144) (← 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)
