"Parity graphs are kernel-M-solvable."

Pierre Duchet (1987)

> Home

Details and statistics

DOI: 10.1016/0095-8956(87)90016-5

access: open

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jct/Duchet87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/Duchet87
Pierre Duchet:
Parity graphs are kernel-M-solvable. J. Comb. Theory B 43(2): 121-126 (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.