Number of the records: 1  

A note on upper bound for chromatic number of a graph

  1. TitleA note on upper bound for chromatic number of a graph
    Author Stacho Ladislav 1970 SAVMATEM - Matematický ústav SAV
    Source document Acta Mathematica Universitatis Comenianae. Vol. 71, no. 1 (2002), p. 1-2
    Languageeng - English
    CountrySK - Slovak Republic
    Document kindrozpis článkov z periodík (rbx)
    CitationsSOTO, María - ROSSI, André - SEVAUX, Marc. Three new upper bounds on the chromatic number. In Discrete Applied Mathematics. ISSN 0166218X, 2011-12-06, 159, 18, pp. 2281-2289.
    VENKATESWARA RAO, J. - SRINIVASA RAO, R. V N. A unique approach on upper bounds for the chromatic number of total graphs. In Asian Journal of Applied Sciences. ISSN 19963343, 2012-05-01, 5, 4, pp. 240-246.
    SOTO, María - ROSSI, André - SEVAUX, Marc - LAURENT, Johann - JUSSIEN, Narendra. Memory Allocation Problems in Embedded Systems: Optimization Methods. 2013. 182 p.
    CategoryADFB - Scientific papers in other domestic journals not registered in Current Contents Connect without IF (non-impacted)
    Category of document (from 2022)V3 - Vedecký výstup publikačnej činnosti z časopisu
    Type of documentčlánok
    Year2002
    article

    article

    rokCCIFIF Q (best)JCR Av Jour IF PercSJRSJR Q (best)CiteScore
    N
    rok vydaniarok metrikyIFIF Q (best)SJRSJR Q (best)
    2002
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.