Pages that link to "Item:Q4881295"
From MaRDI portal
The following pages link to The $L(2,1)$-Labeling Problem on Graphs (Q4881295):
Displaying 50 items.
- \((2,1)\)-Total number of trees with maximum degree three (Q989489) (← links)
- Labeling graphs with two distance constraints (Q998444) (← links)
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications (Q1003574) (← links)
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (Q1005229) (← links)
- \(L(h,k)\)-labelings of Hamming graphs (Q1025475) (← links)
- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes (Q1025490) (← links)
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950) (← links)
- Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings (Q1045046) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- Partial and perfect path covers of cographs (Q1281391) (← links)
- The path-partition problem in block graphs (Q1342260) (← links)
- \(k\)-path partitions in trees (Q1377668) (← links)
- On the \(k\)-path partition of graphs. (Q1401225) (← links)
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
- No-hole \(L(2,1)\)-colorings (Q1408461) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
- \(L(2, 1)\)-labeling of circulant graphs (Q1630932) (← links)
- \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs (Q1653937) (← links)
- \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s (Q1751152) (← links)
- On the number of 2-packings in a connected graph (Q1761463) (← links)
- Systems of distant representatives (Q1764814) (← links)
- \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
- A note on collections of graphs with non-surjective lambda labelings (Q1765378) (← links)
- Path partition for graphs with special blocks (Q1765521) (← links)
- Theory of computational complexity. Part 7. Transl. from the Russian (Q1781794) (← links)
- Frequency assignment problem in networks with limited spectrum (Q1788938) (← links)
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
- Distance-two labelings of graphs (Q1869030) (← links)
- Some results on the injective chromatic number of graphs (Q1928520) (← links)
- On \(L(2,1)\)-labeling of generalized Petersen graphs (Q1928525) (← links)
- Group path covering and distance two labeling of graphs (Q1944096) (← links)
- Radio number for total graph of paths (Q1952708) (← links)
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups (Q1956236) (← links)
- \(L(p,q)\)-labeling of sparse graphs (Q1956243) (← links)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
- The list \(L(2,1)\)-labeling of planar graphs with large girth (Q2039710) (← links)
- Distance two surjective labelling of paths and interval graphs (Q2045355) (← links)
- On \(\text{Ł}(\wp, \wp - 1, \dots, 1)\) labelings of circulant graphs (Q2051682) (← links)
- A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\) (Q2081493) (← links)
- Optimal frequency assignment and planar list \(L(2, 1)\)-labeling (Q2084641) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- On a distance-constrained graph labeling to model cooperation (Q2243133) (← links)
- Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers (Q2253966) (← links)
- The \(L(2,1)\)-labeling of unigraphs (Q2275923) (← links)
- A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\) (Q2279276) (← links)
