Edge colouring by total labellings

DOI10.1016/j.disc.2008.09.013zbMath1283.05082OpenAlexW2032872203MaRDI QIDQ960914

Kristína Budajová, Michael Stiebitz, Stephan Brandt, Dieter Rautenbach

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.013

zbMATH Keywords

discrepancyedge colouringirregularity strengthtotal labelling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

An exact algorithm for the edge coloring by total labeling problem ⋮ Edge coloring by total labelings of outerplanar graphs ⋮ Colourings of graphs by labellings ⋮ Edge coloring total \(k\)-labeling of generalized Petersen graphs ⋮ Edge irregular total labellings for graphs of linear size

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On irregular total labellings
• Edge irregular total labellings for graphs of linear size
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Vertex colouring edge partitions
• Irregular Assignments of Trees and Forests
• A Tight Bound on the Irregularity Strength of Graphs
• On graph irregularity strength
• On a conjecture about edge irregular total labelings
• Total edge irregularity strength of trees
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Geometric discrepancy. An illustrated guide

This page was built for publication: Edge colouring by total labellings