Y. Zhang; J. Meng

On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs

D.A. Mojdeh; B. Samadi; I.G. Yero

Further results on packing related parameters in graphs

X.H. Li; L.G. Wang

Gallai-Ramsey numbers for rainbow $S^{+}_{3}$ and monochromatic paths

S. Francis Raj; M. Gokulnath

b-coloring of the Mycielskian of some classes of graphs

J.N. Chen; S. Kitaev

On the 12-representability of induced subgraphs of a grid graph

J.-L. Shang

Branch-weight unique trees

X. Liu; L. Xiong

Forbidden subgraphs for collapsible graphs and supereulerian graphs

A. Joffard; H. Kheddouci

Labeled packing of cycles and circuits

M. Axenovich; A. Karrer

High girth hypergraphs with unavoidable monochromatic or rainbow edges

F.X. Liu; B. Wu; J.X. Meng

Arbitrarily partitionable $\{2K_2, C_4\}$-free graphs

S.D. Andres; C. Charpentier; W.L. Fong

Game-perfect semiorientations of forests

Ts.Ch-D. Batueva; O.V. Borodin; A.O. Ivanova; D.V. Nikiforov

Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7

M. Bača; A. Ovais; A. Semaničová-Feňovčiková; I.N. Suparta

On face irregular evaluations of plane graphs

B. Brešar; J. Ferme

Graphs that are critical for the packing chromatic number

M. Mezzini

An $O(mn^2)$ algorithm for computing the strong geodetic number in outerplanar graphs

E. Guzman-Garcia; R. Sánchez-López

Corrigendum to: independent transversal domination in graphs [Discuss. Math. Graph Theory 32 (2012) 5-17]

M. Hajian; M.A. Henning; N. Jafari Rad

A classification of cactus graphs according to their domination number

K. Kuenzel; D.F. Rall

On well-covered direct products

H. Chen; C. Lu

Roman $\{2\}$-domination problem in graphs