"The smallest hard-to-color graph for algorithm DSATUR."

Robert Janczewski et al. (2001)

> Home

Details and statistics

DOI: 10.1016/S0012-365X(00)00439-8

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/JanczewskiKMP01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/JanczewskiKMP01
Robert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski:
The smallest hard-to-color graph for algorithm DSATUR. Discret. Math. 236(1-3): 151-165 (2001)

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.