Pages that link to "Item:Q4879166"
From MaRDI portal
The following pages link to On the size of graphs labeled with a condition at distance two (Q4879166):
Displaying 31 items.
- Backbone coloring for graphs with large girths (Q385734) (← links)
- On critical trees labeled with a condition at distance two (Q556846) (← links)
- On distance constrained labeling of disk graphs (Q703553) (← links)
- Distance-two labelings of digraphs (Q881579) (← links)
- On island sequences of labelings with a condition at distance two (Q968105) (← 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)
- Labeling trees with a condition at distance two. (Q1402073) (← 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)
- Greedy \(F\)-colorings of graphs (Q1415540) (← 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)
- Theory of computational complexity. Part 7. Transl. from the Russian (Q1781794) (← links)
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
- Distance-two labelings of graphs (Q1869030) (← links)
- On a distance-constrained graph labeling to model cooperation (Q2243133) (← links)
- List backbone colouring of graphs (Q2440098) (← links)
- Radio number for trees (Q2469993) (← links)
- A bound on the chromatic number of the square of a planar graph (Q2485944) (← links)
- \(L(2,1)\)-labelings of Cartesian products of two cycles (Q2492228) (← links)
- A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
- Systems of pairs of \(q\)-distant representatives, and graph colorings (Q2577585) (← links)
- On the universality and extremality of graphs with a distance constrained colouring (Q2674369) (← links)
- Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs (Q4568089) (← links)
- (Q4683282) (← links)
- (Q4863434) (← links)
- Labeling trees with a condition at distance two (Q5920600) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)
- Online coloring of disk graphs (Q6634381) (← links)
