<mml:math altimg="si5.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>b</mml:mi></mml:math>-coloring of tight graphs-Reference-Cited by-同舟云学术

b-coloring of tight graphs

Author:

Havet Frédéric,Linhares Sales Cláudia,Sampaio Leonardo

Funder

ANR Blanc AGAPE

CNPq/Brazil

CAPES/Brazil

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference22 articles.

3. F. Bonomo, I. Koch, C. Velasquez, On the b-coloring of P4-tidy graphs, Manuscript, 2010.

5. The priority-based coloring approach to register allocation;Chow;ACM Transactions on Programming Languages and Systems,1990

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

1. b-Coloring Parameterized by Clique-Width;Theory of Computing Systems;2023-09-23

2. On b-chromatic number of strong double graph of some graphs;5th INTERNATIONAL CONFERENCE ON CURRENT SCENARIO IN PURE AND APPLIED MATHEMATICS (ICCSPAM-2022);2023

3. Well-partitioned chordal graphs;Discrete Mathematics;2022-10