The Maximum Number of Edges in a Preuniquely k-Colourable Graph with Resistive k-Colourings.

Matthias Wentzlau The Maximum Number of Edges in a Preuniquely k-Colourable Graph with Resistive k-Colourings. 371-383 1992 28 Elektronische Informationsverarbeitung und Kybernetik 6 db/journals/eik/eik28.html#Wentzlau92