"The Maximum k-Colorable Subgraph Problem for Chordal Graphs."

Mihalis Yannakakis, Fanica Gavril (1987)

> Home

Details and statistics

DOI: 10.1016/0020-0190(87)90107-4

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/YannakakisG87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/YannakakisG87
Mihalis Yannakakis, Fanica Gavril:
The Maximum k-Colorable Subgraph Problem for Chordal Graphs. Inf. Process. Lett. 24(2): 133-137 (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.