2 Hits in 1.5 sec

Page 5662 of Mathematical Reviews Vol. , Issue 88k [page]

1988 Mathematical Reviews  
Among other results, the author constructs a preuniquely k- colourable graph with a given number oi vertices, i.e. a nonuniquely k-colourable graph G with the property that the addition of any edge not  ...  Olaru (R-GALA) 88k:05086 05C15 Wentzlau, Matthias (DDR-PHDR) On uniquely and preuniquely k-colourable graphs. (German and Russian summaries) J. Inform. Process. Cybernet. 23 (1987), no. 7, 331-338.  ... 

Page 1268 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
(Michael Griter) 89d:53021 53A10 Wentzlau, Matthias On classes of preuniquely k-colourable graphs.  ...  (Jean-Claude Fournier) 89i:05123 05C15 (05C75) — Uber Eigenschaften von Graphen mit resistenten k-Farbungen. [On properties of graphs with resistant k-colorings} Wiss. Z. Padagog. Hochsch.  ...