Coloring the hypergraph of maximal cliques of a graph with no long path
type: Item
instance of: scholarly article
title: Coloring the hypergraph of maximal cliques of a graph with no long path
zbMATH Open document ID: 1028.05033
DOI: 10.1016/S0012-365X(03)00197-3
author: Sylvain Gravier
author: Chính T. Hoàng
author: Frédéric Maffray
published in: Discrete Mathematics
publication date: 2003-11-25T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 2009168
zbMATH Keywords: Graphs
zbMATH Keywords: Coloring
zbMATH Keywords: Maximal cliques
MaRDI profile type: Publication
cites work: On chromatic number of graphs and set-systems
cites work: Q5749319
cites work: On the divisibility of graphs
cites work: On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
cites work: Sur le coloriage des graphs
description: scientific article; zbMATH DE number 2009168