1234-3099

Discussiones Mathematicae Graph Theory

Institute of Mathematics, University of Zielona Góra, Poland

Health Score

0 Poor

Metadata coverage

Abstract
ORCID
References
License

Extended metadata coverage

Informational — signals of interoperability and funding across the corpus. Not part of the health score.

Funding

Funder
Award / grant

Affiliation & institutional identifiers

Affiliation
ROR ID

Update policy

Update policy

Your prioritized action plan

Ordered by how many DOIs each fix touches — start here, not with every error at once.

1

Add abstracts to 1645 articles

Abstracts are what surface your work in Google Scholar, Dimensions, and OpenAlex.

High impact1645 DOIs
2

Deposit reference lists for 1645 records

Deposited references power Crossref's Cited-by links between your articles and the literature.

High impact1645 DOIs
3

Add license metadata to 1645 records

License metadata tells indexers and readers how each article may be reused.

High impact1645 DOIs

DOIs for this ISSN

Showing the top 5 of 1644 DOIs, ordered by correction priority.

# Title Missing Priority Citations
1 Graph colorings with local constraints -- a survey (10.7151/dmgt.1049)
Abstract References ORCID License
222.53 167
2 Total edge irregularity strength of trees (10.7151/dmgt.1337)
Abstract References ORCID License
191.38 81
3 A characterization of Roman trees (10.7151/dmgt.1178)
Abstract References ORCID License
179.24 61
4 On k-factor-critical graphs (10.7151/dmgt.1022)
Abstract References ORCID License
178.53 60
5 Frequency planning and ramifications of coloring (10.7151/dmgt.1158)
Abstract References ORCID License
177.82 59
6 Associative graph products and their independence, dominatio… (10.7151/dmgt.1023)
Abstract References ORCID License
174.82 55
7 Spanning trees with many or few colors in edge-colored graph… (10.7151/dmgt.1053)
Abstract References ORCID License
170.76 50
8 Some results on path-factor critical avoidable graphs (10.7151/dmgt.2364)
Abstract References ORCID License
169.90 49
9 A survey of hereditary properties of graphs (10.7151/dmgt.1037)
Abstract References ORCID License
169.02 48
10 Total Domination in Categorical Products of Graphs (10.7151/dmgt.1257)
Abstract References ORCID License
167.21 46
11 On light subgraphs in plane graphs of minimum degree five (10.7151/dmgt.1035)
Abstract References ORCID License
166.28 45
12 Offensive alliances in graphs (10.7151/dmgt.1230)
Abstract References ORCID License
166.28 45
13 Secure domination and secure total domination in graphs (10.7151/dmgt.1405)
Abstract References ORCID License
165.32 44
14 Partial covers of graphs (10.7151/dmgt.1159)
Abstract References ORCID License
163.35 42
15 Maximizing spectral radii of uniform hypergraphs with few ed… (10.7151/dmgt.1906)
Abstract References ORCID License
163.35 42
16 On dominating the Cartesian product of a graph and K… (10.7151/dmgt.1238)
Abstract References ORCID License
162.32 41
17 The Steiner Wiener index of a graph (10.7151/dmgt.1868)
Abstract References ORCID License
161.28 40
18 The irregularity of graphs under graph operations (10.7151/dmgt.1733)
Abstract References ORCID License
160.21 39
19 Geodetic sets in graphs (10.7151/dmgt.1112)
Abstract References ORCID License
159.11 38
20 On a special case of Hadwiger's conjecture (10.7151/dmgt.1206)
Abstract References ORCID License
156.82 36
21 The leafage of a chordal graph (10.7151/dmgt.1061)
Abstract References ORCID License
155.63 35
22 The S-packing chromatic number of a graph (10.7151/dmgt.1642)
Abstract References ORCID License
155.63 35
23 The forcing geodetic number of a graph (10.7151/dmgt.1084)
Abstract References ORCID License
151.85 32
24 Graphs with rainbow connection number two (10.7151/dmgt.1547)
Abstract References ORCID License
151.85 32
25 Coloring some finite sets in {R}^{n} (10.7151/dmgt.1641)
Abstract References ORCID License
151.85 32
26 Lower bound on the domination number of a tree (10.7151/dmgt.1222)
Abstract References ORCID License
149.14 30
27 γ-graphs of graphs (10.7151/dmgt.1562)
Abstract References ORCID License
147.71 29
28 On locating and differetiating-total domination in trees (10.7151/dmgt.1414)
Abstract References ORCID License
146.24 28
29 Path and cycle factors of cubic bipartite graphs (10.7151/dmgt.1426)
Abstract References ORCID License
146.24 28
30 On the rainbow vertex-connection (10.7151/dmgt.1664)
Abstract References ORCID License
146.24 28
31 Short cycles of low weight in normal plane maps with minimum… (10.7151/dmgt.1071)
Abstract References ORCID License
144.72 27
32 On Double Domination in Graphs (10.7151/dmgt.1256)
Abstract References ORCID License
144.72 27
33 Some progress on the double Roman domination in graphs (10.7151/dmgt.2069)
Abstract References ORCID License
144.72 27
34 Linear and cyclic radio k-labelings of trees (10.7151/dmgt.1348)
Abstract References ORCID License
143.14 26
35 A survey on packing colorings (10.7151/dmgt.2320)
Abstract References ORCID License
143.14 26
36 Strongly multiplicative graphs (10.7151/dmgt.1133)
Abstract References ORCID License
141.50 25
37 Spectral study of alliances in graphs (10.7151/dmgt.1351)
Abstract References ORCID License
139.79 24
38 Weak Roman domination in graphs (10.7151/dmgt.1532)
Abstract References ORCID License
139.79 24
39 The existence of P_{\ge 3}-factor covered graphs (10.7151/dmgt.1974)
Abstract References ORCID License
139.79 24
40 Unavoidable set of face types for planar maps (10.7151/dmgt.1028)
Abstract References ORCID License
138.02 23
41 Mean value for the matching and dominating polynomial (10.7151/dmgt.1106)
Abstract References ORCID License
138.02 23
42 Trees with unique minimum total dominating sets (10.7151/dmgt.1172)
Abstract References ORCID License
138.02 23
43 Two variants of the size Ramsey number (10.7151/dmgt.1268)
Abstract References ORCID License
138.02 23
44 Regularity and planarity of token graphs (10.7151/dmgt.1959)
Abstract References ORCID License
138.02 23
45 The general position problem on Kneser graphs and on some gr… (10.7151/dmgt.2269)
Abstract References ORCID License
138.02 23
46 A note on total colorings of planar graphs without 4-cycles (10.7151/dmgt.1219)
Abstract References ORCID License
136.17 22
47 Analogues of cliques for oriented coloring (10.7151/dmgt.1237)
Abstract References ORCID License
136.17 22
48 Radio numbers for generalized prism graphs (10.7151/dmgt.1529)
Abstract References ORCID License
136.17 22
49 Adjacent vertex distinguishing edge-colorings of planar grap… (10.7151/dmgt.1556)
Abstract References ORCID License
136.17 22
50 The k-rainbow domatic number of a graph (10.7151/dmgt.1591)
Abstract References ORCID License
136.17 22