"Perfectly orderable graphs are quasi-parity graphs: a short proof."

Alain Hertz, Dominique de Werra (1988)

> Home

Details and statistics

DOI: 10.1016/0012-365X(88)90047-7

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/HertzW88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/HertzW88
Alain Hertz, Dominique de Werra:
Perfectly orderable graphs are quasi-parity graphs: a short proof. Discret. Math. 68(1): 111-113 (1988)

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.