default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 28
Volume 28, Number 1, 2008
- Martin Sonntag, Hanns-Martin Teichert:
Competition hypergraphs of digraphs with certain properties I. Strong connectedness. 5-21 - Martin Sonntag, Hanns-Martin Teichert:
Competition hypergraphs of digraphs with certain properties II. Hamiltonicity. 23-34 - Gary Chartrand, Linda M. Lesniak, Donald W. VanderJagt, Ping Zhang:
Recognizable colorings of graphs. 35-57 - Hong-Yu Chen, Xue-Gang Chen, Wai Chee Shiu:
Trees with equal total and total restrained domination numbers. 59-66 - Chawalit Iamjaroen, Ngo Dac Tan
:
A classfication for maximal nonhamiltonian Burkard-Hammer graphs. 67-89 - Tomás Vetrík:
An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles. 91-96 - Ryota Matsubara, Hajime Matsumura:
Partitions of a graph into cycles containing a specified linear forest. 97-107 - Joanna Raczek:
Weakly connected domination subdivision numbers. 109-119 - Igor Fabrici, Jochen Harant, Stanislav Jendrol':
Paths of low weight in planar graphs. 121-135 - Aneta Dudek, Artur Szymanski, Malgorzata Zwonek:
(H, k) stable graphs with minimum size. 137-149 - Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah:
Maximal k-independent sets in graphs. 151-163 - Mustapha Kchikech, Riadh Khennoufa, Olivier Togni:
Radio k--labelings for Cartesian products of graphs. 165-178 - Richard H. Hammack:
A cancellation property for direct product. 179-184
Volume 28, Number 2, 2008
- Qiongxiang Huang, Ruying Liu, Jianfeng Wang, Chengfu Ye:
The chromatic equivalence class of graph ‾{Bn-6, 12}. 189-218 - Rangaswami Balakrishnan, S. Francis Raj:
The Wiener number of Kneser graphs. 219-228 - Mohammed M. M. Jaradat:
Minimal cycle bases of the lexigraphic product of graphs. 229-247 - Francesc A. Muntaner-Batle, Miquel Rius-Font:
On the structure of paths-like trees. 249-265 - William Klostermeyer, Christina M. Mynhardt:
Secure domination and secure total domination in graphs. 267-282 - Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments. 285-306 - S. Aparna Lakshmanan, Ambat Vijayakumar:
Clique irreducibility of some iterative classes of graphs. 307-321 - Simon Spacapan, Aleksandra Tepeh:
On acyclic colorings of direct produts. 323-333 - Anthony Bonato, Changping Wang:
A note on domination parameters in random graphs. 335-343 - Hong-Hai Li, Jiong-Sheng Li:
An upper bound on the Laplacian spectral radius of the signed graphs. 345-359 - Torsten Korneffel, Dirk Meierling, Lutz Volkmann:
A remark on the (2, 2)-domination number. 361-366 - Thomas Böhme, Tobias Gerlach, Michael Stiebitz:
Ordered and linked chordal graphs. 367-373 - Mariusz Meszka:
Solution to the problem of Kubesa. 375-378
Volume 28, Number 3, 2008
- Mustapha Chellali:
On locating and differetiating-total domination in trees. 383-392 - Ondrej Vacek:
On critical and cocritical radius edge-invariant graphs. 393-418 - Werner Klöckl:
On distinquishing numbers. 419-429 - Dalibor Froncek:
Product rosy labeling of graphs. 431-439 - Jochen Harant, Stanislav Jendrol', Hansjoachim Walther:
On long cycles through four prescribed vertices of a polyhedral graph. 441-451 - Vladimir Samodivkin:
The bondage number of graphs: good and bad vertices. 453-462 - Sheshayya A. Choudum, S. Lavanya:
Embedding complete ternary trees into hypercubes. 463-476 - Changping Wang:
The signed matchings in graphs. 477-486 - Yi-Zheng Fan, Song Wu:
Order unicyclic graphs according to spetral radius of unoriented Laplacian matrix. 487-499 - Ana Paulina Figueroa, Eduardo Rivera-Campo:
On the tree graph of a connected graph. 501-510 - Ramin Imany-Nabiyyi:
The sizes of components in random circle graphs. 511-533 - Beata Orchel, A. Pawel Wojda:
Independent cycles and paths in bipartite balanced graphs. 535-549 - Mikio Kano, Changwoo Lee, Kazuhiro Suzuki:
Path and cycle factors of cubic bipartite graphs. 551-556 - Gurusamy Rengasamy Vijayakumar:
A result related to the largest eigenvalue of a tree. 557-561 - Seog-Jin Kim, Douglas B. West:
Triangle-free planar graphs with minimum degree 3 have radius at least 3. 563-566
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
