"Le nombre minimal de colorations d'un hypergraphe k-chromatique."

Ioan Tomescu (1979)

> Home

Details and statistics

DOI: 10.1016/0012-365X(79)90021-9

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/Tomescu79
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Tomescu79
Ioan Tomescu:
Le nombre minimal de colorations d'un hypergraphe k-chromatique. Discret. Math. 25(2): 179-188 (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.