Particionamento de Grafos Cordais em Conjuntos Independentes e Cliques
Abstract
Full Text:
PDF (Português (Brasil))References
[1] A. Brandst¨adt, Partitions of graphs into one or two independent sets and cliques, Discrete Mathematics, 152 (1996), 47-54.
A. Brandst¨adt, The complexity of some problems related to graph 3- colorability, Discrete Applied Mathematics, 89 (1998), 59-73.
T. Feder, P. Hell, S. Klein, and R. Motwani, Complexity of graph partition problems, em “The 31st Annual ACM Symposium on Theory of Computing - STOC’99” ( F. W. Thatcher and R. E. Miller, eds.), pp. 464-472, Plenum Press, New York, 1999.
S. Foldes and P. Hammer, Split Graphs, em “ 8th Southeastern Conf. on Combinatorics, Graph Theory and Computing” (F. Hoffman et al., eds.), pp. 311-315, Louisiana State Univ., Baton Rouge, Louisiana.
L. T. Nogueira, “ Grafos Split e Grafos Split Generalizados”, Tese de Mestrado, COPPE-Sistemas, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, Brazil, 1999.
M. R. Garey, D. S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theoretical Computer Science, 1 (1976), 237-267.
M. C. Golumbic, “ Algorithmic Graph Theory and Perfect Graphs”, Academic Press, New York, 1980.
DOI: https://doi.org/10.5540/tema.2002.03.01.0147
Article Metrics
Metrics powered by PLOS ALM
Refbacks
- There are currently no refbacks.
Trends in Computational and Applied Mathematics
A publication of the Brazilian Society of Applied and Computational Mathematics (SBMAC)
Indexed in: