On a conjecture about edge irregular total labelings

From MaRDI portal
Publication:5387019


DOI10.1002/jgt.20287zbMath1188.05109WikidataQ123359023 ScholiaQ123359023MaRDI QIDQ5387019

Jozef Miškuf, Stephan Brandt, Dieter Rautenbach

Publication date: 14 May 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20287


05C78: Graph labelling (graceful graphs, bandwidth, etc.)


Related Items

On cycle-irregularity strength of ladders and fan graphs, On H-irregularity strengths of G-amalgamation of graphs, On reflexive edge strength of generalized prism graphs, On H-irregularity strength of cycles and diamond graphs, On -irregularity strength of ladders and fan graphs, On the edge irregular reflexive labeling of corona product of graphs with path, Total edge irregularity strength of generalized prism, Irregular labelings of helm and sun graphs, A survey of irregularity strength, Edge coloring by total labelings of outerplanar graphs, Total edge irregularity strength of large graphs, Irregular total labellings of generalized Petersen graphs, Edge colouring by total labellings, Edge irregular total labellings for graphs of linear size, Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs, On edge irregular reflexive labellings for the generalized friendship graphs, Colourings of graphs by labellings, On irregularity strength of diamond network, On total edge irregularity strength for some special types of uniform theta snake graphs, Total edge irregularity strength of toroidal fullerene, On total \(H\)-irregularity strength of the disjoint union of graphs, Edge irregular reflexive labeling for disjoint union of generalized Petersen graph, On H-irregularity strength of graphs, Total edge irregularity strength of accordion graphs, On edge irregular total labeling of categorical product of two cycles, On total edge irregularity strength of generalized web graphs and related graphs, Total irregularity strength of three families of graphs



Cites Work