"Maximum k-colorable subgraphs."

Stephen C. Locke (1982)

> Home

Details and statistics

DOI: 10.1002/JGT.3190060206

access: closed

type: Journal Article

metadata version: 2021-09-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/Locke82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/Locke82
Stephen C. Locke:
Maximum k-colorable subgraphs. J. Graph Theory 6(2): 123-132 (1982)

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.