"Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique."

Aistis Atminas et al. (2015)

> Home

Details and statistics

DOI: 10.37236/4074

access: closed

type: Journal Article

metadata version: 2022-06-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorics/AtminasBKLV15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/AtminasBKLV15
Aistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter:
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique. Electron. J. Comb. 22(2): 2 (2015)

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.