Discussiones Mathematicae Graph Theory - Journal - MOST Wiedzy

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
2020 70 Ministry Scored Journals List 2019
Ministry points
Year Points List
2020 70 Ministry Scored Journals List 2019
2019 70 Ministry Scored Journals List 2019
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
2009 9 B
2008 9 B

Model:

Open Access

Punkty CiteScore:

Punkty CiteScore
2018 0.73
Punkty CiteScore
Year Points
2018 0.73
2017 0.64
2016 0.42

Impact Factor:

Log in to see the Impact Factor.

Publishing policy:

License: CC BY-NC-ND 3.0
License
Creative Commons: CC-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
Repository for Scientific Papers
Author's Homepage
Institutional Website
Non-Commercial Services
Information on research data policy
n/a
Additional information
Indexed in DOAJ
Must link to journal homepage with DOI.

Filters

total: 26

  • Category
  • Year
  • Options

Catalog Journals

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 in external service

  • Graph classes generated by Mycielskians
    Publication

    - Discussiones Mathematicae Graph Theory - 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

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

    - Discussiones Mathematicae Graph Theory - 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.

  • 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 in external service

2016
  • Some variations of perfect graphs
    Publication

    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 in external service

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 in external service

  • TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
    Publication

    - Discussiones Mathematicae Graph Theory - 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 in external service

2011
  • Convex universal fixers
    Publication

    Praca dotyczy dominowania wypukłego w grafach pryzmowych.

    Full text in external service

  • 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 in external service

  • Parity vertex colouring of graphs
    Publication

    - Discussiones Mathematicae Graph Theory - 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 in external service

  • Preface
    Publication

    - Discussiones Mathematicae Graph Theory - 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 in external service

2010
2009
2008
2007
2006

seen 268 times