EUVIMED · CrossrefJournal
Discussiones Mathematicae Graph Theory
ISSN 1234-3099 · University of Zielona Góra, Poland
Latest articles
Erratum to “The thickness of amalgamations and Cartesian product of graphs" [Discuss. Math. Graph Theory 37(2017) 561–572]
Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
Structural properties and characterizations of \mathbf{W} p class
Domination number versus packing number in graphs
Varieties of mutual-visibility and general position on Sierpiński graphs
Contractible sets in 3-connected planar graphs via Schnyder woods
Multigraphs with a unique partition into cycles
Preservation of the \mathbb{Z} k property of a graph under edge addition
The minimum size of maximal bipartite IC-plane graphs with given connectivity
Liar's vertex-edge domination in unit disk graph
Turán numbers of subdivisions of multipartite graphs
Parity conditions for one-way rail networks
On nut graphs with two vertex and three edge orbits
On 2-edge-Hamiltonian-connected line graphs of planar graphs
The existence of {P2, P5}-factors in graphs
Classification of quartic bicirculant nut graphs
Regular K 3 -regular graphs
Double dominating sequences in bipartite and co-bipartite graphs
On q -connected chordal graphs with minimum number of spanning trees
Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
On antipodal and diametrical partial cubes
On some properties of antipodal partial cubes
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
On a total version of 1-2-3 Conjecture
The number of P-vertices of singular acyclic matrices: An inverse problem
On well-covered direct products
On semi-transitive orientability of triangle-free graphs
On some characterizations of antipodal partial cubes
The thickness of amalgamations and Cartesian product of graphs
The Steiner Wiener index of a graph
EUVIMED