Discussiones Mathematicae Graph Theory 33 (2) (2013)
| 1 | C. Hernández-Cruz 4-transitive digraphs I: the structure of strong 4-transitive digraphs | PDF | 247 |
| 2 | M. Frick, J. Singleton, S. Van Aardt Independent detour transwersals in 3-deficient digraphs | PDF | 261 |
| 3 | W. Kordecki, A. Łyczkowska-Hanćkowiak Exact expectation and variance of minimal basic of random matroids | PDF | 277 |
| 4 | X. Chen, Y. Gao, B. Yao Vertex-distinguishing IE-total colorings of complete bipartite graphs $K_{m,n}$($m<n$) | PDF | 289 |
| 5 | X. Li, Y.T. Shi On the rainbow vertex-connection | PDF | 307 |
| 6 | É. Sopena, J. Wu The incidence chromatic number of toroidal grids | PDF | 315 |
| 7 | R. Hammack Frucht's theorem for the digraph factorial | PDF | 329 |
| 8 | M. Chellali, N. Jafari Rad Strong equality between the Roman domination and independent Roman domination numbers in trees | PDF | 337 |
| 9 | S. Fujita, H. Liu The balanced decomposition number of $TK_{4}$ and series -parallel graphs | PDF | 347 |
| 10 | R. Pandiya Raj, H.P. Patil On the total graph of Mycielski graphs, central graphs and their covering numbers | PDF | 361 |
| 11 | T. Karthick, C.R. Subramanian Star coloring of subcubic graphs | PDF | 373 |
| 12 | M. Mollard On domination of Cartesian product of directed cycles: Results for certain equivalence classes of lengths | PDF | 387 |
| 13 | M. Blidia, N. Meddah A characterization of trees for a new lower bound on the $ k$-independence number | PDF | 395 |
| 14 | B. Phinezy, P. Zhang On closed modular colorings of trees | PDF | 411 |
| 15 | S. Wang, R.X. Wang Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs | PDF | 429 |
| 16 | R.D. Dutton, W.F. Klostermeyer Edge dominating sets and vertex covers | PDF | 437 |
| 17 | A. Bickle Two short proofs on total domination | PDF | 457 |
| 18 | J.-S. Sereni, Z.B. Yilma A tight bound on the set chromatic number | PDF | 461 |
| 19 | Y. Otachi The path-distance-width of hypercubes | PDF | 467 |