"Coloring the hypergraph of maximal cliques of a graph with no long path."

Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray (2003)

> Home

Details and statistics

DOI: 10.1016/S0012-365X(03)00197-3

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/GravierHM03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/GravierHM03
Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray:
Coloring the hypergraph of maximal cliques of a graph with no long path. Discret. Math. 272(2-3): 285-290 (2003)

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.