"Smallest 3-graphs having a 3-colored edge in every k-coloring."

F. Sterboul (1979)

> Home

Details and statistics

DOI: 10.1016/0012-365X(79)90111-0

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/Sterboul79
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Sterboul79
F. Sterboul:
Smallest 3-graphs having a 3-colored edge in every k-coloring. Discret. Math. 27(2): 205-210 (1979)

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.