Journal: Discussiones Mathematicae Graph Theory

Volume 33, Issue 4

637 -- 648Gurusamy Rengasamy Vijayakumar. Characterizations of the family of all generalized line graphs-finite and infinite- and classification of the family of all graphs whose least eigenvalues ≥ -2
649 -- 656Hongyu Liang. Some sharp bounds on the negative decision number of graphs
657 -- 664Boram Park, Yoshio Sano. The phylogeny graphs of double partial orders
665 -- 676Gabriela Karafová. Generalized fractional total coloring of complete graphs
677 -- 693Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson. Weak saturation numbers for sparse graphs
695 -- 707V. Chitra, Appu Muthusamy. Symmetric Hamilton cycle decompositions of complete multigraphs
709 -- 715Lutz Volkmann. Bounds on the signed 2-independence number in graphs
717 -- 730H. Aram, S. Norouzian, Seyed Mahmoud Sheikholeslami, Lutz Volkmann. The distance Roman domination numbers of graphs
731 -- 745Renu C. Laskar, Henry Martyn Mulder. Path-neigborhood graphs
747 -- 757Odile Favaron. b-domatic number of a graph
756 -- 770Oleg V. Borodin, Anna O. Ivanova. Precise upper bound for the strong edge chromatic number of sparse planar graphs
771 -- 784Elliot Krop, Irina Krop. Almost -rainbow edge-colorings of some small graphs
785 -- 790Jernej Azarija. Sharp uppper and lower bounds on the number of spanning trees in Cartesian product graphs

Volume 33, Issue 3

475 -- 0Ewa Drgas-Burchardt, Elzbieta Sidorowicz. Preface
477 -- 492Izak Broere, Johannes Heidema, Peter Mihók. Universality in graph properties with degree restrictions
493 -- 507Enrique Casas-Bautista, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy. γ-cycles and transivity by monochromatic paths in arc-coloured digraphs
509 -- 519Július Czap, Peter Mihók. Q-coloring of graphs
521 -- 530Július Czap, Zsolt Tuza. Decompositions of plane graphs under parity constrains given by faces
531 -- 557Reinhardt Euler, Pawel Oleksik, Zdzislaw Skupien. Counting maximal distance-independent sets in grid graphs
559 -- 569Ján Katrenic, Gabriel Semanisin. Maximum semi-matching problem in bipartite graphs
571 -- 582Marián Klesc, Jana Petrillová. The crossing numbers of products of path with graphs of order six
583 -- 597Marián Klesc, Stefan Schrötter. On the crossing numbers of Cartesian products of stars and graphs of order six
599 -- 602Wojciech Kordecki, Anna Lyczkowska-Hanckowiak. Broken circuits in matroids-Dohmen's inductive proof
603 -- 611Xueliang Li, Mengmeng Liu, Ingo Schiermeyer. Rainbow connection number of dense graphs
613 -- 632Hrant Khachatrian, Petros A. Petrosyan, Hovhannes Tananyan. Interval edge-colorings of Cartesian products of graphs I

Volume 33, Issue 2

247 -- 260César Hernández-Cruz. 4-transitive digraphs I: the structure of strong 4-transitive digraphs
261 -- 275Marietjie Frick, Joy Singleton, Susan A. van Aardt. Independent detour transwersals in 3-deficient digraphs
277 -- 288Wojciech Kordecki, Anna Lyczkowska-Hanckowiak. Exact expectation and variance of minimal basic of random matroids
289 -- 306Xiang'en Chen, Yuping Gao, Bing Yao. m<n)
307 -- 313Xueliang Li, Yongtang Shi. On the rainbow vertex-connection
315 -- 327Eric Sopena, Jiaojiao Wu. The incidence chromatic number of toroidal grids
329 -- 336Richard Hammack. Frucht's theorem for the digraph factorial
337 -- 346Mustapha Chellali, Nader Jafari Rad. Strong equality between the Roman domination and independent Roman domination numbers in trees
347 -- 359Shinya Fujita, Henry Liu. 4 and series -parallel graphs
361 -- 371R. Pandiyaraj, H. P. Patil. On the total graph of Mycielski graphs, central graphs and their covering numbers
373 -- 385T. Karthick, C. R. Subramanian. Star coloring subcubic graphs
387 -- 394Michel Mollard. On domination of Cartesian product of directed cycles: Results for certain equivalence
395 -- 410Mostafa Blidia, Nacéra Meddah. k-independence number
411 -- 428Bryan Phinezy, Ping Zhang. On closed modular colorings of trees
429 -- 435Shiying Wang, Ruixia Wang. Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs
437 -- 456Ronald D. Dutton, William Klostermeyer. Edge dominating sets and vertex covers
457 -- 459Allan Bickle. Two short proofs on total domination
461 -- 465Jean-Sébastien Sereni, Zelealem B. Yilma. A tight bound on the set chromatic number
467 -- 470Yota Otachi. The path-distance-width of hypercubes

Volume 33, Issue 1

5 -- 6Ewa Drgas-Burchardt, Mariusz Haluszczak, Maria Kwasnik, Danuta Michalak, Elzbieta Sidorowicz. Preface
7 -- 0Izak Broere, Peter Mihók. Hereditarnia
9 -- 23Kinnari Amin, Jill R. Faudree, Ronald J. Gould, Elzbieta Sidorowicz. p-free graphs
25 -- 31József Balogh, Alexandr V. Kostochka, Andrei Raigorodskii. n
33 -- 47Izak Broere, Johannes Heidema. Universality for and in induced-hereditary graph properties
49 -- 55Ewa Drgas-Burchardt. A note on the uniqueness of stable marriage matching
57 -- 69Reinhardt Euler, Pawel Oleksik. × n latin rectangle completable?
71 -- 89Igor Fabrici, Erhard Hexel, Stanislav Jendrol. On vertices enforcing a Hamiltonian cycle
91 -- 99Anna Fiedorowicz. Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree
101 -- 115Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda. q, k) stable graphs
117 -- 131Marietjie Frick. A survey of the Path Partition Conjecture
133 -- 137Jochen Harant. A note on Barnette's Conjecture
139 -- 146Michael A. Henning, Douglas F. Rall. On graphs with disjoint dominating and 2-dominating sets
147 -- 165Mirko Hornák, Stanislav Jendrol, Ingo Schiermeyer. On maximum weight of a bipartite graph of given order and size
167 -- 179Arnfried Kemnitz, Peter Mihók, Margit Voigt. P, Q)-total list colorings of graphs
181 -- 192Arnfried Kemnitz, Jakub Przybylo, Ingo Schiermeyer, Mariusz Wozniak. Rainbow connection in sparse graphs
193 -- 201Justyna Otfinowska, Mariusz Wozniak. A note on uniquely embeddable forests
203 -- 215Mirka Miller, Joe Ryan, Zdenek Ryjácek. Distance-locally disconnected graphs
217 -- 229Zdzislaw Skupien. Sums of powered characteristic roots count distance-independent circular sets
231 -- 242Zsolt Tuza. Choice-perfect graphs