Pages that link to "Item:Q1010805"
From MaRDI portal
The following pages link to Irregularity strength of regular graphs (Q1010805):
Displaying 36 items.
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (Q306111) (← links)
- Distant irregularity strength of graphs (Q394284) (← links)
- Neighbor sum distinguishing index of planar graphs (Q396740) (← links)
- Minimum-weight edge discriminators in hypergraphs (Q405305) (← links)
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz (Q477256) (← links)
- Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- An iterative approach to graph irregularity strength (Q708356) (← links)
- On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
- A new upper bound for the total vertex irregularity strength of graphs (Q1045029) (← links)
- Colourings of graphs by labellings (Q1687834) (← links)
- Distant total irregularity strength of graphs via random vertex ordering (Q1699557) (← links)
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
- Distant total sum distinguishing index of graphs (Q1712511) (← links)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (Q1740118) (← links)
- Irregular labelings of circulant graphs (Q1761466) (← links)
- Distant sum distinguishing index of graphs (Q2012525) (← links)
- On edge \(H\)-irregularity strengths of some graphs (Q2042607) (← links)
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970) (← links)
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture (Q2274072) (← links)
- Neighbor sum distinguishing total colorings of triangle free planar graphs (Q2355461) (← links)
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525) (← links)
- Distant irregularity strength of graphs with bounded minimum degree (Q2410259) (← links)
- Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs (Q2516498) (← links)
- Modular irregularity strength of graphs (Q4958009) (← links)
- Distant sum distinguishing index of graphs with bounded minimum degree (Q5217057) (← links)
- On vertex and edge H-irregularity strengths of graphs (Q5298356) (← 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)
- Sum-distinguishing number of sparse hypergraphs (Q6171496) (← links)
