Discussiones Mathematicae Graph Theory 27 (3) (2007)
| 1 | H. Galeana-Sánchez, L. A. J. Ramírez Monochromatic kernel-perfectness of special classes of digraphs | PDF | 389 |
| 2 | G. T. Chen, K. Kawarabayashi, K. Ota, A. Saito, I. Schiermeyer Chvátal Erd\''{o}s condition and 2-factors with a specyfied number of components | PDF | 401 |
| 3 | R.R. Rubalcaba, P.J. Slater Efficient $(j,k)-$domination | PDF | 409 |
| 4 | D.R. Woodall Some totally 4-choosable multigraphs | PDF | 425 |
| 5 | W. Szumny, A. Włoch, I. Włoch On $(k,l)$-kernels in $\cal D$-join of digraphs | PDF | 457 |
| 6 | J. Hage, T. Harju Towards a characterization of bipartite switching classes by means of forbidden subgraphs | PDF | 471 |
| 7 | G. Chartrand, L. Nebeský, P. Zhang Distance defined by spanning trees in graphs | PDF | 485 |
| 8 | M. J. Ferrara, R. J. Gould, S.G. Hartke The structure and existence of 2-factors in iterated line graphs | PDF | 507 |
| 9 | R.G. Gibson, C.M. Mynhardt Couterexample to a conjecture on the structure of bipartite partionable graphs | PDF | 527 |
| 10 | M. Walsh Fractional domination in prisms | PDF | 541 |
| 11 | P.T. Ho A proof of the crossing number of $K_{3,n}$ in a surface | PDF | 549 |
| 12 | P. Hatami An approximation algorithm for the total covering problem | PDF | 553 |
| 13 | W. Frydrych, A. Żak Preface to Proceedings | PDF | 559 |
| 14 | Z. Skupień '3in1' enhanced: Three squares ways to "3in 1" GRAPHS | PDF | 561 |
| 15 | S. Bylka, J. Komar The representation of multi-hypergraphs by set intersections | PDF | 565 |
| 16 | J. Ivančo Magic and supermagic dense bipartite graphs | PDF | 583 |
| 17 | W. Imrich, W. Klöckl Factoring directed graphs with respect to the cardinal product in polynomial time | PDF | 593 |
| 18 | M. Knor Minimal non-selfcentric radially-maximal graphs of radius 4 | PDF | 603 |
| 19 | Z. Dziechcińska-Halamoda, Z. Majcher, J. Michael, Z. Skupień A Sokoban-type game and arc deletion within irregular digraphs of all sizes | PDF | 611 |