Discussiones Mathematicae Graph Theory - Journal - Bridge of Knowledge

Search

Discussiones Mathematicae Graph Theory

ISSN:

1234-3099

eISSN:

2083-5892

Publisher:

Uniwersytet Zielonogórski , Walter de Gruyter (Sciendo)

Disciplines
(Field of Science):

  • Mechanical engineering (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 100 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 15 A
2017 15 A
2016 15 A
2015 15 A
2014 10 B
2013 10 B
2012 8 B
2011 8 B
2010 9 B

Model:

Open Access

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2022 1.9
Points CiteScore - previous years
Year Points
2022 1.9
2021 1.7
2020 1.5
2019 1.4
2018 1.2
2017 0.9
2016 0.7
2015 0.7
2014 0.8
2013 0.7
2012 0.5
2011 0.3

Impact Factor:

Log in to see the Impact Factor.

Publishing policy:

License: CC BY-NC-ND 3.0
License
Creative Commons: BY-NC-ND 3.0 open in new tab
Information on publishing policy
https://content.sciendo.com/view/journals/dmgt/dmgt-overview.xml open in new tab
Information on the conditions of self-archiving
https://www.dmgt.uz.zgora.pl/system_pages/agreement_demo.php open in new tab
Is self-archiving allowed by the journal?
Yes - with restrictions
Submitted Version Help
yes
Accepted Version Help
yes
Published Version Help
yes
Self-archiving places
Non-Commercial Services
Repository for Scientific Papers
Institutional Website
Author's Homepage
Information on research data policy
n/a
Months of embargo
no embargo
Additional information
Indexed in DOAJ
Must link to journal homepage with DOI.

Filters

total: 28

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2023
  • Restrained differential of a graph
    Publication

    - Discussiones Mathematicae Graph Theory - Year 2023

    Given a graph $G=(V(G), E(G))$ and a vertex $v\in V(G)$, the {open neighbourhood} of $v$ is defined to be $N(v)=\{u\in V(G) :\, uv\in E(G)\}$. The {external neighbourhood} of a set $S\subseteq V(G)$ is defined as $S_e=\left(\cup_{v\in S}N(v)\right)\setminus S$, while the \emph{restrained external neighbourhood} of $S$ is defined as $S_r=\{v\in S_e : N(v)\cap S_e\neq \varnothing\}$. The restrained differential of a graph $G$ is...

    Full text available to download

Year 2021
Year 2020
  • A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4

    In the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...

    Full text available to download

  • Graph classes generated by Mycielskians
    Publication

    - Discussiones Mathematicae Graph Theory - Year 2020

    In this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...

    Full text available to download

Year 2019
Year 2018
Year 2017
  • Equitable coloring of corona multiproducts of graphs
    Publication

    - Discussiones Mathematicae Graph Theory - Year 2017

    We give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.

    Full text available to download

  • Interval incidence coloring of subcubic graphs

    In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.

    Full text available to download

Year 2016
  • Some variations of perfect graphs
    Publication

    - Discussiones Mathematicae Graph Theory - Year 2016

    We consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...

    Full text available to download

Year 2015
  • Optimal backbone coloring of split graphs with matching backbones

    For a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.

    Full text available to download

  • TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
    Publication

    - Discussiones Mathematicae Graph Theory - Year 2015

    The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msd_t (G) of a graph G and we show that for any connected graph G of order at least two, msd_t (G) ≤ 3. We show that for trees the total domination...

    Full text available to download

Year 2011
  • Convex universal fixers
    Publication

    Praca dotyczy dominowania wypukłego w grafach pryzmowych.

    Full text available to download

  • Graphs with equal domination and 2-distance domination numbers

    W publikacji scharakteryzowane są wszystkie te drzewa i grafy jednocykliczne, w których liczba dominowania oraz liczba 2-dominowania na odległość są sobie równe.

    Full text available to download

  • Parity vertex colouring of graphs
    Publication

    - Discussiones Mathematicae Graph Theory - Year 2011

    A parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...

    Full text available to download

  • Preface
    Publication

    - Discussiones Mathematicae Graph Theory - Year 2011

    This special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 13th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 18-23 September 2009 in Szklarska Poręba, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, and 2003-2007 in Karpacz. The meeting was organized by the Faculty of Mathematics, Computer...

    Full text available to download

Year 2010
Year 2009

seen 1072 times