The following pages link to Distance-two labelings of graphs (Q1869030):
Displaying 32 items.
- Distance-two labelings of digraphs (Q881579) (← links)
- \(L(0,1)\)-labelling of permutation graphs (Q894561) (← links)
- Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q930929) (← links)
- The \(L(2,1)\)-labeling on Cartesian sum of graphs (Q953888) (← links)
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198) (← links)
- Labeling graphs with two distance constraints (Q998444) (← links)
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (Q1005229) (← links)
- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes (Q1025490) (← links)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Labeling trees with a condition at distance two. (Q1402073) (← links)
- \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs (Q1680868) (← links)
- Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph (Q1708400) (← links)
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
- A note on exact distance labeling (Q1944109) (← links)
- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs (Q2012895) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- Two-distance-primitive graphs (Q2223445) (← links)
- On representations of graphs as two-distance sets (Q2279265) (← links)
- A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
- A note on distance-\(k\) labeling and \(k\)th powers of graphs (Q2718336) (← links)
- Distance labeling in graphs (extended abstract) (Q2768294) (← links)
- \(L(j,k)\)-labelings and \(L(j,k)\)-edge-labelings of graphs. (Q2846633) (← links)
- Distance two labeling of the composition of graphs (Q2911184) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- Graph distance‐dependent labeling related to code assignment in computer networks (Q4667824) (← links)
- On the size of graphs labeled with a condition at distance two (Q4879166) (← links)
- On irreducible no‐hole <i>L</i>(2, 1)‐coloring of trees (Q5191141) (← links)
- (Q5224754) (← links)
- On the<i>L</i>(2, 1)-labelling of block graphs (Q5391500) (← links)
- (Q5872528) (← links)
- \(L(p,q)\)-labeling and integer tension of a graph embedded on torus (Q5963610) (← links)
