scientific article
From MaRDI portal
Publication:3824455
zbMath0671.05060MaRDI QIDQ3824455
Farrokh Saba, Sergio Ruiz, Michael S. Jacobson, Ortrud R. Oellermann, Jenő Lehel, Gary Chartrand
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
A note on adjacent vertex distinguishing colorings of graphs ⋮ Total edge irregularity strength of generalized prism ⋮ Irregular weighting of 1-designs ⋮ On edge irregularity strength of graphs ⋮ Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz ⋮ The irregularity cost or sum of a graph ⋮ A smallest irregular oriented graph containing a given diregular one ⋮ A note on the weak \((2,2)\)-conjecture ⋮ Asymptotically optimal neighbor sum distinguishing total colorings of graphs ⋮ Distant set distinguishing total colourings of graphs ⋮ Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs ⋮ Computing the irregularity strength of planar graphs ⋮ The irregular coloring number of a tree ⋮ Note on group irregularity strength of disconnected graphs ⋮ Irregular labelings of helm and sun graphs ⋮ Asymptotically optimal neighbour sum distinguishing colourings of graphs ⋮ The 1,2-conjecture for powers of cycles ⋮ A survey of irregularity strength ⋮ Neighbor sum distinguishing total choosability of planar graphs ⋮ Irregularity strength of the toroidal grid ⋮ Irregular embeddings of hypergraphs with fixed chromatic number ⋮ Irregular embeddings of multigraphs with fixed chromatic number ⋮ The irregularity strength of \(tK_ p\) ⋮ On edge irregular reflexive labellings for the generalized friendship graphs ⋮ Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited ⋮ GRAPH LABELLING TECHNIQUES ⋮ Decomposing oriented graphs into six locally irregular oriented graphs ⋮ Going wide with the 1-2-3 conjecture ⋮ Vertex-distinguishing edge-colorings of 2-regular graphs ⋮ The irregularity strength and cost of the union of cliques ⋮ Neighbour-distinguishing labellings of powers of paths and powers of cycles ⋮ On irregular total labellings ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ On H-irregularity strength of graphs ⋮ Vertex-coloring 2-edge-weighting of graphs ⋮ Total edge irregularity strength of accordion graphs ⋮ A Vizing-like theorem for union vertex-distinguishing edge coloring ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ The sigma chromatic number of a graph ⋮ Edge irregular reflexive labeling for the \(r\)-th power of the path ⋮ The irregularity cost of a graph ⋮ Distant set distinguishing edge colourings of graphs ⋮ Colourings of graphs by labellings ⋮ On the neighbor sum distinguishing total coloring of planar graphs ⋮ On a total version of 1-2-3 conjecture ⋮ Total irregularity strength of disjoint union of isomorphic copies of generalized Petersen graph ⋮ 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 ⋮ On edge irregular total labeling of categorical product of two cycles ⋮ On irregularity strength of diamond network ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Gap vertex-distinguishing edge colorings of graphs ⋮ Edge coloring total \(k\)-labeling of generalized Petersen graphs ⋮ New estimates for the gap chromatic number ⋮ A note on face coloring entire weightings of plane graphs ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ A note on vertex colorings of plane graphs ⋮ The irregularity strength of \(tP_ 3\) ⋮ On the number of irregular assignments on a graph ⋮ On entire face irregularity strength of disjoint union of plane graphs ⋮ On bounds for the product irregularity strength of graphs ⋮ Vertex coloring of graphs by total 2-weightings ⋮ On the edge irregularity strength of corona product of cycle with isolated vertices ⋮ On weight choosabilities of graphs with bounded maximum average degree ⋮ Irregularity strength of regular graphs of large degree ⋮ Edge colouring by total labellings ⋮ Total edge irregularity strength of complete graphs and complete bipartite graphs ⋮ On the complexity of determining the irregular chromatic index of a graph ⋮ Irregular labelings of circulant graphs ⋮ Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs ⋮ Note on the group edge irregularity strength of graphs ⋮ Distant sum distinguishing index of graphs ⋮ An iterative approach to graph irregularity strength ⋮ On the total vertex irregularity strength of trees ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture ⋮ On twin edge colorings of graphs ⋮ Total irregularity strength of three families of graphs ⋮ On the total neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ On edge \(H\)-irregularity strengths of some graphs ⋮ Unnamed Item ⋮ Note on edge irregular reflexive labelings of graphs ⋮ Upper bounds on inclusive distance vertex irregularity strength ⋮ Irregular networks, regular graphs and integer matrices with distinct row and column sums ⋮ Unnamed Item ⋮ Edge irregular total labellings for graphs of linear size ⋮ A new upper bound for the total vertex irregularity strength of graphs ⋮ deBruijn-like sequences and the irregular chromatic number of paths and cycles ⋮ Irregularity strength of digraphs ⋮ Product irregularity strength of graphs ⋮ Irregularity strength of trees ⋮ On the hardness of determining the irregularity strength of graphs ⋮ Edge irregular reflexive labeling for disjoint union of generalized Petersen graph ⋮ The irregularity strength of circulant graphs ⋮ AVD-total-colouring of complete equipartite graphs ⋮ Computing an irregularity strength of selected graphs ⋮ On decomposing regular graphs into locally irregular subgraphs ⋮ Group irregularity strength of connected graphs ⋮ On face irregular evaluations of plane graphs ⋮ On proper labellings of graphs with minimum label sum
This page was built for publication:
