On the b-continuity property of graphs-Reference-Cited by-同舟云学术

On the b-continuity property of graphs

Published:2007-08 Issue:13 Volume:155 Page:1761-1768
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Barth Dominique,Cohen Johanne,Faik Taoufik

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference13 articles.

1. D. Barth, J. Cohen, T. Faik, Complexity of determining the b-continuity property of graphs, PRiSM Technical Report 2003/37, Université de Versailles S.Q., 2003

2. Graphs;Berge,1985

3. Achromatic number is NP-complete for cographs and interval graphs;Bodlaender;Inform. Process. Lett.,1989

4. About the b-continuity of graphs;Faik;Electron. Notes in Discrete Math.,2004

5. T. Faik, La b-continuité des b-colorations: complexité, propriétés structurelles et algorithmes, Ph.D. Thesis no. 7880, Université Paris XI Orsay, 2005 (in French).

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

1. An Iterative Matheuristic Algorithm for the B-Coloring Problem;2022 The 3rd International Conference on Industrial Engineering and Industrial Management;2022-01-12

2. Upper and lower bounds based on linear programming for the b-coloring problem;EURO Journal on Computational Optimization;2022

3. A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic;European Journal of Operational Research;2021-11

4. b-continuity and partial Grundy coloring of graphs with large girth;Discrete Mathematics;2020-08

5. A complexity dichotomy for critical values of the b-chromatic number of graphs;Theoretical Computer Science;2020-05