Coloring the hypergraph of maximal cliques of a graph with no long path-Reference-Cited by-同舟云学术

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

Published:2003-11 Issue:2-3 Volume:272 Page:285-290
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Gravier Sylvain,Hoàng Chı́nh T.,Maffray Frédéric

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference6 articles.

1. G. Bacsó, S. Gravier, A. Gyárfás, M. Preissmann, A. Sebő, Coloring the maximal cliques of graphs, Research Report 32, Laboratoire Leibniz, France, 2001 (http://www-leibniz.imag.fr/LesCahiers/2001/Cahier32).

2. On the chromatic number of graphs and set systems;Erdős;Acta Math. Acad. Sci. Hungar.,1966

3. A. Gyárfás, Problems from the world surrounding perfect graphs, Zastosowania Matematyki—Applicationes Mathematicae XIX (3–4) (1987) 413–441.

4. On the divisibility of graphs;Hoàng;Discrete Math.,2002

5. On the NP-completeness of the k-colorability problem for triangle-free graphs;Maffray;Discrete Math.,1996

Cited by 52 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Structure of some ( P7, C4)-free graphs with application to colorings;Discrete Applied Mathematics;2024-11

2. χ-binding function for (C4, t-broom+)-free graphs;Discrete Mathematics;2024-10

3. The optimal χ-bound for (P7,C4,C5)-free graphs;Discrete Mathematics;2024-07

4. The (a, b)-monochromatic transversal game on clique-hypergraphs of powers of cycles;RAIRO - Operations Research;2024-03

5. Coloring (P5, kite)-free graphs with small cliques;Discrete Applied Mathematics;2024-02