Pages that link to "Item:Q2467731"
From MaRDI portal
The following pages link to \((p,1)\)-total labelling of graphs (Q2467731):
Displayed 14 items.
- \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
- 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)
- On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- Complexity of (p,1)-total labelling (Q967327) (← links)
- (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) (← links)
- Corrigendum to ``\((p,1)\)-total labelling of graphs'' [Discrete math. 308 (2008) 496-513] (Q982632) (← links)
- \((2,1)\)-Total number of trees with maximum degree three (Q989489) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
- \((p,q)\)-total labeling of complete graphs (Q1956251) (← links)
- \(L(2, 1)\)-labelings of the edge-path-replacement of a graph (Q2392735) (← links)
- The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 (Q3000498) (← links)