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

Matthias Wentzlau (1992)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2020-03-06

- no documents available
- export record
  dblp key:
  - journals/eik/Wentzlau92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eik/Wentzlau92
Matthias Wentzlau:
The Maximum Number of Edges in a Preuniquely k-Colourable Graph with Resistive k-Colourings. J. Inf. Process. Cybern. 28(6): 371-383 (1992)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.