Number of the records: 1
Complexity of approximation of 3-edge-coloring of graphs
Title Complexity of approximation of 3-edge-coloring of graphs Author Kochol Martin 1961 SAVMATEM - Matematický ústav SAV Co-authors Krivoňáková N. Smejová S. Šranková K. Source document Information Processing Letters. Vol. 108 (2008), p. 238-241 Language eng - English Country NL - Netherlands Document kind rozpis článkov z periodík (rbx) Citations Mazzuoccolo, G. The NP-completeness of automorphic colorings. In Discussiones Mathematicae Graph Theory, 2010, vol. 30, p. 705-710. LUKOŤKA, R., MÁČAJOVÁ, E., MAZÁK, J., ŠKOVIERA. Snarks withlarge oddness and small number of vertices. In Nešetřil, J., Pellegrini, M. (edts.) The Seventh European Conference on Combinatorics, Graph Theory and Applications, Eurocomb 2013, Publiocations of the Scuola Normale Suuperiore, CRM series, vol. 16, Scuola Normale Superiore, Pisa, 2013, p. 59-64. DEHGHAN, Ali - SADEGHI, Mohammad-Reza - AHADI, Arash. On the Complexity of Deciding Whether the Regular Number is at Most Two. In GRAPHS AND COMBINATORICS. ISSN 0911-0119, 2015, vol. 31, no. 5, p. 1359-1365. Category ADCA - Scientific papers in foreign journals registered in Current Contents Connect with IF (impacted) Category of document (from 2022) V3 - Vedecký výstup publikačnej činnosti z časopisu Type of document článok Year 2009 
article
rok CC IF IF Q (best) JCR Av Jour IF Perc SJR SJR Q (best) CiteScore A rok vydania rok metriky IF IF Q (best) SJR SJR Q (best) 2008 2007 0.660 Q3 0.694 Q2
Number of the records: 1