DISCRETE MATHEMATICS
Skrót:
DISCRETE MATH
ISSN:
0012-365X
Rok | Punkty ministerialne | Impact Factor | Eigenfactor | Article influence |
---|---|---|---|---|
2023 | 100 | 0.00969 | 0.564 | |
2022 | 100 | 0.00998 | 0.582 | |
2021 | 100 | 0.01132 | 0.658 | |
2020 | 100 | 0.01139 | 0.664 | |
2019 | 100 | 0.012 | 0.604 | |
2018 | 25 | 0.01136 | 0.556 | |
2017 | 25 | 0.01355 | 0.603 | |
2016 | 25 | 0.01269 | 0.552 | |
2015 | 20 | 0.01605 | 0.603 | |
2014 | 25 | 0.02106 | 0.589 | |
2013 | 20 | 0.0255 | 0.585 | |
2012 | 20 | 0.02292 | 0.526 | |
2011 | 20 | 0.02456 | 0.532 | |
2010 | 20 | 0.02363 | 0.502 | |
2009 | 15 | 0.02239 | 0.511 | |
2008 | 15 | 0.01901 | 0.485 | |
2007 | 0 | 0.02481 | 0.543 |
Publikacje:
21.
János Barát, Andrzej Grzesik, Attila Jung, Zoltán Lóránt Nagy, Dömötör Pálvölgyi
The double Hall property and cycle covers in bipartite graphs, Discrete Mathematics vol. 347 (9) (2024), 114079
20.
Hoang La, Borut Lužar, Kenny Štorgel
19.
A note on the restricted partition function $p_\mathcal{A}(n,k)$, Discrete Mathematics vol. 345 (9) (2022), 112943
18.
Łukasz Bożyk, Andrzej Grzesik, Bartłomiej Kielak
On the inducibility of oriented graphs on four vertices, Discrete Mathematics vol. 345 (7) (2022), 112874
17.
Marcin Briański, Adam Szady
16.
Hat chromatic number of graphs, Discrete Mathematics vol. 344(12) (2021), 112620
15.
James Aaronson, Carla Groenland, Andrzej Grzesik, Tom Johnston, Bartłomiej Kielak
Exact hyperplane covers for subsets of the hypercube, Discrete Mathematics vol. 334 (9) (2021), 112490
14.
Michał Seweryn
13.
Bartłomiej Bosek, Michał Farnik, Jarosław Grytczuk, Sebastian Czerwiński, Tomasz Bartnicki, Zofia Miechowicz
Generalized arboricity of graphs with large girth, Discrete Mathematics vol. 342(5) (2019), 1343-1350
12.
Bartłomiej Bosek, Michał Dębski, Jarosław Grytczuk, Joanna Sokół, Małgorzata Śleszyńska-Nowak, Wiktor Żelazny
Graph coloring and Graham’s greatest common divisor problem, Discrete Mathematics vol. 341(3) (2018), 781-785
11.
István Mező, Piotr Miska, Chenying Wang
The r-derangement numbers, Discrete Mathematics vol. 340 (2017), 1681–1692
10.
On formal inverse of the Prouhet–Thue–Morse sequence, Discrete Mathematics vol. 339 (5) (2016), 1459-1470
9.
Janusz Adamus, Lech Adamus
A degree condition for cycles of maximum length in bipartite digraphs, Discrete Mathematics vol. 312 (2012), 1117-1122
8.
Indicated colorings of graphs, Discrete Mathematics vol. 312 (2012), 3467-3472
7.
Parity in graph sharing games, Discrete Mathematics vol. 312 (2012), 1788-1795
6.
Bartłomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek
On-line version of Rabinovitch theorem for proper intervals, Discrete Mathematics vol. 312(23) (2012), 3426-3436
5.
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
How to eat 4/9 of a pizza, Discrete Mathematics vol. 311 (2011), 1635-1645
4.
Bostjan Bresar, Jarosław Grytczuk, Iztok Peterin, Sandi Klavzar, Stanisław Niwczyk
Nonrepetitive colorings of trees, Discrete Mathematics vol. 307 (2008), 163-172
3.
Jarosław Grytczuk, Hal Kierstead, Tomasz Bartnicki
The game of arboricity, Discrete Mathematics vol. 308 (2008), 1388-1393
2.
Noga Alon, Jarosław Grytczuk
Breaking the rhythm on graphs, Discrete Mathematics vol. 308 (2008), 1375-1380
1.
Jarosław Grytczuk
Thue type problems for graphs, points, and numbers, Discrete Mathematics vol. 308 (2008), 4419-4429