default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 27
Volume 27, Number 1, 2007
- Brice Effantin, Hamamache Kheddouci:
Grundy number of graphs. 5-18 - Mustapha Chellali, Teresa W. Haynes:
Global Alliances and Independence in Trees. 19-27 - Ingo Schiermeyer, Mariusz Wozniak:
New sufficient conditions for hamiltonian and pancyclic graphs. 29-38 - Anthony Bonato:
A note on uniquely H-colorable graphs. 39-44 - Monika Pilsniak, Mariusz Wozniak:
A note on packing of two copies of a hypergraph. 45-49 - Kim A. S. Factor, Larry J. Langley:
Digraphs with underlying and domination graphs: Connected UGc(D). 51-67 - Yi-Zheng Fan, Shi-Cai Gong:
Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two. 69-82 - Joanna Raczek
:
Trees with restrained domination and total restrained domination numbers. 83-91 - Adriana Hansberg Pastor, Lutz Volkmann:
Characterization of block graphs with equal 2-domination number and domination number plus one. 93-103 - Mustapha Kchikech, Riadh Khennoufa, Olivier Togni:
Linear and cyclic radio k-labelings of trees. 105-123 - Wayne Goddard, Kiran Kanakadandi:
Orientation distance graphs revisited. 125-136 - Ingo Schiermeyer:
A new upper bound for the chromatic number of a graph. 137-142 - Juan Alberto Rodríguez-Velázquez, José María Sigarreta:
Spectral study of alliances in graphs. 143-157 - Wenjie He, Yufa Shen, Guoping Zheng:
Improved upper bounds for nearly antipodal chromatic number of paths. 159-174 - Xinmin Hou:
Total domination of Cartesian products of graphs. 175-178 - Daniël Paulusma, Kiyoshi Yoshimoto:
Cycles through specified vertices in triangle-free graphs. 179-191 - Abdollah Khodkar, Rui Xu:
More on even [a, b]-factors in graphs. 193-204
Volume 27, Number 2, 2007
- Premysl Holub:
On distance local connectivity and vertex distance colouring. 209-227 - Ahmed Ainouche, Serge Lapiquonne:
Variations on a sufficient condition for Hamiltonian graphs. 229-240 - Sylwia Cichacz:
Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails. 241-249 - Suresh Manjanath Hegde, Mirka Miller:
Futher results on sequetially additive graphs. 251-268 - Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin:
Erdõs regular graphs of even degree. 269-279 - Yuejian Peng:
Subgraph densities in hypergraphs. 281-297 - Bernardo Llano, Mika Olsen:
Infinite families of tight regular tournaments. 299-311 - Sandi Klavzar, Matjaz Kovse:
On Tetha-graphs of partial cubes. 313-321 - Tomoki Yamashita:
Vertex-dominating cycles in 2-connected bipartite graphs. 323-332 - Bostjan Bresar, Simon Spacapan:
Edge-connectivity of strong products of graphs. 333-343 - Ludovít Niepel:
Histories in path graphs. 345-357 - Hortensia Galeana-Sánchez, Ricardo Gómez:
(k, l)-kernels, (k, l)-semikernels, k-Grundy functions and duality for state splittings. 359-371 - Yi-Zheng Fan, Yi Wang, Jun Zhou:
On the second largest eigenvalue of a mixed graph. 373-384
Volume 27, Number 3, 2007
- Hortensia Galeana-Sánchez, Luis Alberto Jiménez Ramírez:
Monochromatic kernel-perfectness of special classes of digraphs. 389-400 - Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer:
Chvátal Erdós condition and 2-factors with a specyfied number of components. 401-407 - Robert R. Rubalcaba, Peter J. Slater:
Efficient (j, k)-domination. 409-423 - Douglas R. Woodall:
Some totally 4-choosable multigraphs. 425-455 - Waldemar Szumny, Andrzej Wloch, Iwona Wloch:
On (k, l)-kernels in D-join of digraphs. 457-470 - Jurriaan Hage, Tero Harju:
Towards a characterization of bipartite switching classes by means of forbidden subgraphs. 471-483 - Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Distance defined by spanning trees in graphs. 485-506 - Michael J. Ferrara, Ronald J. Gould, Stephen G. Hartke:
The structure and existence of 2-factors in iterated line graphs. 507-526 - Richard G. Gibson, Christina M. Mynhardt:
Couterexample to a conjecture on the structure of bipartite partionable graphs. 527-540 - Matthew Walsh:
Fractional domination in prisms. 541-547 - Pak-Tung Ho:
A proof of the crossing number of K3, n in a surface. 549-551 - Pooya Hatami:
An approximation algorithm for the total covering problem. 553-558 - Waclaw Frydrych, Andrzej Zak:
Preface to Proceedings. 561- - Zdzislaw Skupien:
'3in1' enhanced: Three squares ways to "3in 1" GRAPHS. 561-563 - Stanislaw Bylka, Jan Komar:
The representation of multi-hypergraphs by set intersections. 565-582 - Jaroslav Ivanco:
Magic and supermagic dense bipartite graphs. 583-591 - Wilfried Imrich, Werner Klöckl:
Factoring directed graphs with respect to the cardinal product in polynomial time. 593-601 - Martin Knor:
Minimal non-selfcentric radially-maximal graphs of radius 4. 603-610 - Zyta Dziechcinska-Halamoda, Zofia Majcher, Jerzy Michael, Zdzislaw Skupien:
A Sokoban-type game and arc deletion within irregular digraphs of all sizes. 611-622
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 2024-12-29 01:27 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:
