Journal: Discussiones Mathematicae Graph Theory

Volume 28, Issue 3

383 -- 392Mustapha Chellali. On locating and differetiating-total domination in trees
419 -- 429Werner Klöckl. On distinquishing numbers
431 -- 439Dalibor Froncek. Product rosy labeling of graphs
441 -- 451Jochen Harant, Stanislav Jendrol, Hansjoachim Walther. On long cycles through four prescribed vertices of a polyhedral graph
453 -- 462Vladimir Samodivkin. The bondage number of graphs: good and bad vertices
463 -- 476Sheshayya A. Choudum, S. Lavanya. Embedding complete ternary trees into hypercubes
477 -- 486Changping Wang. The signed matchings in graphs
487 -- 499Yi-Zheng Fan, Song Wu. Order unicyclic graphs according to spetral radius of unoriented Laplacian matrix
501 -- 510Ana Paulina Figueroa, Eduardo Rivera-Campo. On the tree graph of a connected graph
511 -- 533Ramin Imany-Nabiyyi. The sizes of components in random circle graphs
535 -- 549Beata Orchel, A. Pawel Wojda. Independent cycles and paths in bipartite balanced graphs
551 -- 556Mikio Kano, Changwoo Lee, Kazuhiro Suzuki. Path and cycle factors of cubic bipartite graphs
557 -- 561Gurusamy Rengasamy Vijayakumar. A result related to the largest eigenvalue of a tree
563 -- 566Seog-Jin Kim, Douglas B. West. Triangle-free planar graphs with minimum degree 3 have radius at least 3

Volume 28, Issue 2

189 -- 218Qiongxiang Huang, Ruying Liu, Jianfeng Wang, Chengfu Ye. The chromatic equivalence class of graph ::::‾{B::n-6, 12::}::::
219 -- 228Rangaswami Balakrishnan, S. Francis Raj. The Wiener number of Kneser graphs
229 -- 247Mohammed M. M. Jaradat. Minimal cycle bases of the lexigraphic product of graphs
249 -- 265Francesc A. Muntaner-Batle, Miquel Rius-Font. On the structure of paths-like trees
267 -- 282William Klostermeyer, Christina M. Mynhardt. Secure domination and secure total domination in graphs
285 -- 306Hortensia Galeana-Sánchez, Rocío Rojas-Monroy. Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments
307 -- 321S. Aparna Lakshmanan, Ambat Vijayakumar. Clique irreducibility of some iterative classes of graphs
323 -- 333Simon Spacapan, Aleksandra Tepeh. On acyclic colorings of direct produts
335 -- 343Anthony Bonato, Changping Wang. A note on domination parameters in random graphs
345 -- 359Hong-Hai Li, Jiong-Sheng Li. An upper bound on the Laplacian spectral radius of the signed graphs
361 -- 366Torsten Korneffel, Dirk Meierling, Lutz Volkmann. A remark on the (2, 2)-domination number
367 -- 373Thomas Böhme, Tobias Gerlach, Michael Stiebitz. Ordered and linked chordal graphs
375 -- 378Mariusz Meszka. Solution to the problem of Kubesa

Volume 28, Issue 1

5 -- 21Martin Sonntag, Hanns-Martin Teichert. Competition hypergraphs of digraphs with certain properties I. Strong connectedness
23 -- 34Martin Sonntag, Hanns-Martin Teichert. Competition hypergraphs of digraphs with certain properties II. Hamiltonicity
35 -- 57Gary Chartrand, Linda M. Lesniak, Donald W. VanderJagt, Ping Zhang 0004. Recognizable colorings of graphs
59 -- 66Hong-yu. Chen, Xue-Gang Chen, Wai Chee Shiu. Trees with equal total and total restrained domination numbers
67 -- 89Chawalit Iamjaroen, Ngo Dac Tan. A classfication for maximal nonhamiltonian Burkard-Hammer graphs
91 -- 96Tomás Vetrík. An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles
97 -- 107Ryota Matsubara, Hajime Matsumura. Partitions of a graph into cycles containing a specified linear forest
109 -- 119Joanna Raczek. Weakly connected domination subdivision numbers
121 -- 135Igor Fabrici, Jochen Harant, Stanislav Jendrol. Paths of low weight in planar graphs
137 -- 149Aneta Dudek, Artur Szymanski, Malgorzata Zwonek. ::::(H, k):::: stable graphs with minimum size
151 -- 163Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah. Maximal k-independent sets in graphs
165 -- 178Mustapha Kchikech, Riadh Khennoufa, Olivier Togni. Radio ::::k-::::-labelings for Cartesian products of graphs
179 -- 184Richard Hammack. A cancellation property for direct product