Pages that link to "Item:Q4490788"
From MaRDI portal
The following pages link to A Tight Bound on the Irregularity Strength of Graphs (Q4490788):
Displaying 50 items.
- Total edge irregularity strength of generalized prism (Q272396) (← links)
- A survey of irregularity strength (Q324899) (← links)
- Distant irregularity strength of graphs (Q394284) (← links)
- Minimum-weight edge discriminators in hypergraphs (Q405305) (← links)
- Spectral bounds for the \(k\)-independence number of a graph (Q501229) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- An iterative approach to graph irregularity strength (Q708356) (← links)
- On the total vertex irregularity strength of trees (Q710612) (← links)
- On irregular total labellings (Q878629) (← links)
- Edge colouring by total labellings (Q960914) (← links)
- Total edge irregularity strength of complete graphs and complete bipartite graphs (Q960943) (← links)
- Edge irregular total labellings for graphs of linear size (Q1043545) (← links)
- A new upper bound for the total vertex irregularity strength of graphs (Q1045029) (← links)
- Product irregularity strength of graphs (Q1045179) (← links)
- The Moore bound for irregular graphs (Q1348665) (← links)
- A note on the weak \((2,2)\)-conjecture (Q1625809) (← links)
- Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs (Q1634474) (← 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)
- Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs (Q2008185) (← links)
- Note on the group edge irregularity strength of graphs (Q2009255) (← links)
- Distant sum distinguishing index of graphs (Q2012525) (← links)
- On edge \(H\)-irregularity strengths of some graphs (Q2042607) (← links)
- Upper bounds on inclusive distance vertex irregularity strength (Q2053732) (← links)
- On the hardness of determining the irregularity strength of graphs (Q2089679) (← links)
- Going wide with the 1-2-3 conjecture (Q2166211) (← links)
- The 1-2-3 conjecture almost holds for regular graphs (Q2222048) (← links)
- On the complexity of determining the irregular chromatic index of a graph (Q2253909) (← 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)
- Edge irregular reflexive labeling for disjoint union of generalized Petersen graph (Q2337265) (← links)
- On decomposing regular graphs into locally irregular subgraphs (Q2349960) (← links)
- On H-irregularity strength of graphs (Q2409796) (← links)
- Total edge irregularity strength of accordion graphs (Q2410103) (← links)
- Distant irregularity strength of graphs with bounded minimum degree (Q2410259) (← links)
- Edge coloring total \(k\)-labeling of generalized Petersen graphs (Q2444742) (← links)
- Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs (Q2516498) (← links)
- Total irregularity strength of three families of graphs (Q2516510) (← links)
- The irregularity strength of circulant graphs (Q2576828) (← links)
- Distant set distinguishing total colourings of graphs (Q2629496) (← links)
- Edge irregular reflexive labeling for the \(r\)-th power of the path (Q2671084) (← links)
- Total irregularity strength of the generalized web graph \(W_0(t,3)\) (Q2792608) (← links)
- An Entropy-Based Proof for the Moore Bound for Irregular Graphs (Q2821702) (← links)
- Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs (Q3439595) (← links)
