"A sufficient condition for a digraph to be kernel-perfect."

Pierre Duchet (1987)

> Home

Details and statistics

DOI: 10.1002/JGT.3190110112

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/Duchet87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/Duchet87
Pierre Duchet:
A sufficient condition for a digraph to be kernel-perfect. J. Graph Theory 11(1): 81-85 (1987)

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.