"Perfectly orderable graphs and almost all perfect graphs are ..."

Mostafa Blidia, Konrad Engel (1992)

> Home

Details and statistics

DOI: 10.1007/BF02350628

access: closed

type: Journal Article

metadata version: 2020-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/BlidiaE92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/BlidiaE92
Mostafa Blidia, Konrad Engel:
Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable. Graphs Comb. 8(2): 103-108 (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.