The following pages link to (Q4873753):
Displaying 43 items.
- Minimum-weight edge discriminators in hypergraphs (Q405305) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- An iterative approach to graph irregularity strength (Q708356) (← links)
- On the number of irregular assignments on a graph (Q1182886) (← links)
- On the vertex-distinguishing proper edge-colorings of graphs (Q1305536) (← links)
- Codings of graphs with binary edge labels (Q1323484) (← links)
- Irregular weighting of 1-designs (Q1331997) (← links)
- Irregularity strength of the toroidal grid (Q1356786) (← links)
- Vertex-distinguishing edge-colorings of 2-regular graphs (Q1373171) (← links)
- The irregularity cost of a graph (Q1388975) (← links)
- Irregularity strength of trees (Q1584380) (← links)
- Note on group irregularity strength of disconnected graphs (Q1643408) (← links)
- On edge irregular reflexive labellings for the generalized friendship graphs (Q1649059) (← links)
- Distant set distinguishing edge colourings of graphs (Q1686263) (← links)
- Colourings of graphs by labellings (Q1687834) (← links)
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← links)
- Distant total irregularity strength of graphs via random vertex ordering (Q1699557) (← links)
- Distant total sum distinguishing index of graphs (Q1712511) (← links)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- The irregular coloring number of a tree (Q1894778) (← links)
- Irregular embeddings of hypergraphs with fixed chromatic number (Q1901037) (← links)
- The irregularity strength of \(tK_ p\) (Q1901052) (← links)
- The irregularity strength and cost of the union of cliques (Q1916108) (← links)
- Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs (Q2008185) (← links)
- Distant sum distinguishing index of graphs (Q2012525) (← links)
- The 1-2-3 conjecture almost holds for regular graphs (Q2222048) (← links)
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture (Q2274072) (← links)
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree (Q2292151) (← links)
- Note on edge irregular reflexive labelings of graphs (Q2293828) (← links)
- On decomposing regular graphs into locally irregular subgraphs (Q2349960) (← links)
- Distant irregularity strength of graphs with bounded minimum degree (Q2410259) (← links)
- The irregularity strength of circulant graphs (Q2576828) (← links)
- On the irregularity strength of them ×n grid (Q4014275) (← links)
- On graph irregularity strength (Q4798109) (← links)
- (Q4852566) (← links)
- On reflexive edge strength of generalized prism graphs (Q5054039) (← links)
- On the edge irregular reflexive labeling of corona product of graphs with path (Q5165023) (← links)
- Distant sum distinguishing index of graphs with bounded minimum degree (Q5217057) (← links)
- Irregular subgraphs (Q5885195) (← links)
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) (← links)
- A generalization of Faudree–Lehel conjecture holds almost surely for random graphs (Q6052468) (← links)
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees (Q6081547) (← links)
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment (Q6568836) (← links)