GRAPHS AND COMBINATORICS - Journal - Bridge of Knowledge

Search

GRAPHS AND COMBINATORICS

ISSN:

0911-0119

eISSN:

1435-5914

Disciplines
(Field of Science):

  • Information and communication technology (Engineering and Technology)
  • Computer and information sciences (Natural sciences)
  • Mathematics (Natural sciences)

Ministry points: Help

Ministry points - current year
Year Points List
Year 2024 70 Ministry scored journals list 2024
Ministry points - previous years
Year Points List
2024 70 Ministry scored journals list 2024
2023 70 Ministry Scored Journals List
2022 70 Ministry Scored Journals List 2019-2022
2021 70 Ministry Scored Journals List 2019-2022
2020 70 Ministry Scored Journals List 2019-2022
2019 70 Ministry Scored Journals List 2019-2022
2018 20 A
2017 20 A
2016 20 A
2015 15 A
2014 15 A
2013 15 A
2012 15 A
2011 15 A
2010 20 A

Model:

Hybrid

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2022 0.9
Points CiteScore - previous years
Year Points
2022 0.9
2021 0.9
2020 1.1
2019 1.1
2018 1.1
2017 1.1
2016 1.1
2015 1
2014 1
2013 0.9
2012 1
2011 0.8

Impact Factor:

Log in to see the Impact Factor.

Filters

total: 7

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2021
  • Independent Domination Subdivision in Graphs
    Publication

    - GRAPHS AND COMBINATORICS - Year 2021

    A set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...

    Full text available to download

Year 2018
  • Dynamic F-free Coloring of Graphs
    Publication

    - GRAPHS AND COMBINATORICS - Year 2018

    A problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...

    Full text to download in external service

  • Total Domination Versus Domination in Cubic Graphs
    Publication

    A dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...

    Full text available to download

Year 2015
  • The Backbone Coloring Problem for Bipartite Backbones

    Let G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...

    Full text to download in external service

Year 2014
Year 2008

seen 506 times