-coloring of tight graphs
- 1 December 2012
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 160 (18) , 2709-2715
Abstract
No abstract availableKeywords
Funding Information
- ANR Blanc AGAPE
- CNPq/Brazil
- CAPES/Brazil
- ANR Blanc AGAPE
This publication has 18 references indexed in Scilit:
- Bounds for the b-chromatic number of some families of graphsDiscrete Mathematics, 2006
- Efficient algorithms for graphs with few P4'sDiscrete Mathematics, 2001
- The b-chromatic number of a graphDiscrete Applied Mathematics, 1999
- P4-laden graphs: A new class of brittle graphsInformation Processing Letters, 1996
- On a unique tree representation for P4-extendible graphsDiscrete Applied Mathematics, 1991
- The priority-based coloring approach to register allocationACM Transactions on Programming Languages and Systems, 1990
- An introduction to timetablingEuropean Journal of Operational Research, 1985
- Register allocation by priority-based coloringACM SIGPLAN Notices, 1984
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973