Estimating the fractional chromatic number of a graph

$Estimating the fractional chromatic number of a graph Cover$

.blurhash-client-img { display: none !important; }

Open Access

|Jul 2021

[1] I. M. Bomze, M. Budinich, P. M. Pardalos, M. Pelillo, The Maximum Clique Problem, Handbook of Combinatorial Optimization Vol. 4, Kluwer Academic Publisher, 1999. ⇒12310.1007/978-1-4757-3023-4_1
Open DOI Search in Google Scholar Back to article
[2] M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, New York, 2003. ⇒123
Search in Google Scholar Back to article
[3] J. Hasselberg, P. M. Pardalos, G. Vairaktarakis, Test case generators and computational results for the maximum clique problem, Journal of Global Optimization 3 (1993) 463–482. ⇒13210.1007/BF01096415
Open DOI Search in Google Scholar Back to article
[4] C. H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, Inc., Reading, MA 1994. ⇒123
Search in Google Scholar Back to article
[5] N. J. A. Sloane, Challenge Problems: Independent Sets in Graphs. https://oeis.org/A265032/a265032.html ⇒132
Search in Google Scholar Back to article
[6] S. Szabó, Monotonic matrices and clique search in graphs, Annales Univ. Sci. Budapest., Sect. Computatorica 41 (2013), 307–322. ⇒132
Search in Google Scholar Back to article
[7] E. W. Weisstein, Monotonic Matrix, In: MathWorld–A Wolfram Web Resource. http://mathworld.wolfram.com/MonotonicMatrix.html ⇒132
Search in Google Scholar Back to article

Language: English

Page range: 122 - 133

Submitted on: Apr 1, 2021

Accepted on: May 16, 2021

Published online: Jul 8, 2021

Published in print: Jun 1, 2021

Published by: Sapientia Hungarian University of Transylvania

In partnership with: Paradigm Publishing Services

Publication frequency: 2 issues per year

Keywords:

MSC:

Related subjects:

© 2021 Sándor Szabó, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution 4.0 License.