Erratum to: “Local edge domination critical graphs” [Discrete Math. 161 (1996) 175–184]

The proof of the main theorem in the paper Henning et al. (1996) [2] is incorrect as it is missing an important case. Here we complete the proof by giving the missing case.     

Corrigendum to “(p,1)-total labelling of graphs” [Discrete Math. 308 (2008) 496–513]

We give a corrected proof of Proposition 51 of the paper cited in the title.     

Erratum to “Forbidden pairs for spanning (closed) trails” [Discrete Math. 340 (2017) 1012–1018]

In this Erratum, we correct a flaw in Lv and Xiong (2017) and give a supplement of one result in it.     

Addendum to: “Hamilton-laceable bi-powers of locally finite bipartite graphs” [Discrete Math. 345 (2022) 112777]

In this addendum we give a short and easy negative answer to the two questions raised in the original article.     

Corrigendum to “A criterion for the half-plane property” [Discrete Math. 309 (2008) 1385–1390]

We correct a small error in the paper mentioned in the title.     

Corrigendum to “Colorings and spectral radius of digraphs” [Discrete Math. 339 (1) (2016) 327–332]

Two errors in the original article are corrected so as to validate the major results. Thus, the digraphs that have the minimum and second minimum spectral radius among all strongly connected digraphs with given order and dichromatic number are determined.     

Corrigendum to “The D-optimal saturated designs of order 22” [Discrete Math. 341 (2018) 380–387]

A matrix that was not included in Table 2 of the paper cited in the title is presented.     

Erratum to “Edge-choosability in line-perfect multigraphs” [Discrete Mathematics 202 (1999) 191]

A multigraph is line perfect if its line graph is perfect. In (Discrete Math. 202 (1999) 191) we claimed that if every edge e of a line-perfect multigraph G is given a list containing at least as many colors as there are edges in a largest edge-clique containing e, then G can be edge-colored from its lists. This note corrects a mistake in our proof.