Weakly completable critical sets for proper vertex and edge colourings of graphs

David R. B. Burgess, A. Donald Keedwell. Weakly completable critical sets for proper vertex and edge colourings of graphs. Australasian J. Combinatorics, 24:35-46, 2001. [doi]

Abstract

Abstract is missing.