scientific article; zbMATH DE number 867641
From MaRDI portal
Publication:4873753
zbMath0841.05052MaRDI QIDQ4873753
Publication date: 22 April 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (43)
Irregular subgraphs ⋮ Irregular weighting of 1-designs ⋮ On graph irregularity strength ⋮ On reflexive edge strength of generalized prism graphs ⋮ The irregular coloring number of a tree ⋮ Note on group irregularity strength of disconnected graphs ⋮ Irregularity strength of the toroidal grid ⋮ Irregular embeddings of hypergraphs with fixed chromatic number ⋮ The irregularity strength of \(tK_ p\) ⋮ On edge irregular reflexive labellings for the generalized friendship graphs ⋮ Vertex-distinguishing edge-colorings of 2-regular graphs ⋮ The irregularity strength and cost of the union of cliques ⋮ On the irregularity strength of them ×n grid ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ The irregularity cost of a graph ⋮ Distant set distinguishing edge colourings of 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 neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Distant total irregularity strength of graphs via random vertex ordering ⋮ Distant total sum distinguishing index of graphs ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ On the number of irregular assignments on a graph ⋮ On weight choosabilities of graphs with bounded maximum average degree ⋮ On the edge irregular reflexive labeling of corona product of graphs with path ⋮ Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of 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 ⋮ On the total neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Note on edge irregular reflexive labelings of graphs ⋮ Unnamed Item ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ Irregularity strength of trees ⋮ On the vertex-distinguishing proper edge-colorings of graphs ⋮ The irregularity strength of circulant graphs ⋮ On decomposing regular graphs into locally irregular subgraphs ⋮ Codings of graphs with binary edge labels
This page was built for publication:
