Irregularity strength of regular graphs
From MaRDI portal
Publication:1010805
zbMath1163.05329MaRDI QIDQ1010805
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/129984
Related Items (36)
Irregular subgraphs ⋮ Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz ⋮ A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles ⋮ On vertex and edge H-irregularity strengths of graphs ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ Distant irregularity strength of graphs ⋮ Neighbor sum distinguishing index of planar graphs ⋮ A generalization of Faudree–Lehel conjecture holds almost surely for random graphs ⋮ Colourings of graphs by labellings ⋮ Minimum-weight edge discriminators in hypergraphs ⋮ Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees ⋮ Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture ⋮ On the neighbor sum distinguishing total coloring of planar graphs ⋮ Distant total irregularity strength of graphs via random vertex ordering ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ Distant total sum distinguishing index of graphs ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 ⋮ Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz ⋮ Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 ⋮ Neighbor sum distinguishing total colorings of planar graphs ⋮ The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles ⋮ On weight choosabilities of graphs with bounded maximum average degree ⋮ Irregular labelings of circulant graphs ⋮ Distant sum distinguishing index of graphs ⋮ An iterative approach to graph irregularity strength ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ Modular irregularity strength of graphs ⋮ Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs ⋮ On edge \(H\)-irregularity strengths of some graphs ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ A new upper bound for the total vertex irregularity strength of graphs ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs
This page was built for publication: Irregularity strength of regular graphs
