default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 29
Volume 29, Number 1, 2009
- Terry A. McKee:
Strongly pancyclic and dual-pancyclic graphs. 5-14 - Mustapha Aouchiche
, Pierre Hansen, Dragan Stevanovic:
Variable neighborhood search for extremal graphs.17. Futher conjectures and results about the index. 15-37 - Hortensia Galeana-Sánchez, Laura Pastrana:
k-Kernels and some operations in digraphs. 39-49 - Darren B. Parker, Randy F. Westhoff, Marty J. Wolf:
Convex independence and the structure of clone-free multipartite tournaments. 51-69 - Johannes H. Hattingh, Ernst J. Joubert, Marc Loizeaux, Andrew R. Plummer, Lucas C. van der Merwe:
Restrained domination in unicyclic graphs. 71-86 - Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh:
Decompositions of quadrangle-free planar graphs. 87-99 - Pietra Delgado-Escalante, Hortensia Galeana-Sánchez:
Kernels and cycles' subdivisions in arc-colored tournaments. 101-117 - Robert Fidytek, Hanna Furmanczyk, Pawel Zylinski:
Equitable coloring of Kneser graphs. 119-142 - Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman:
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. 143-162 - Daniel W. Cranston:
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles. 163-178 - Italo J. Dejter:
Quasiperfect domination in triangular lattices. 179-198 - Artur Szymanski, A. Pawel Wojda:
A note on k-uniform self-complementary hypergraphs of given order. 199-202
Volume 29, Number 2, 2009
- Piotr Borowiecki, Danuta Michalak, Elzbieta Sidorowicz:
Preface of guest editors. 207 - Halina Bielak:
Multicolor Ramsey numbers for some paths and cycles. 209-218 - Mieczyslaw Borowiecki, Anna Fiedorowicz, Mariusz Haluszczak:
Acyclic reducible bounds for outerplanar graphs. 219-239 - Jozef Bucko, Peter Mihók:
On infinite uniquely partitionable graphs and graph properties of finite character. 241-251 - Dariusz Dereniowski:
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs. 253-261 - Ewa Drgas-Burchardt:
Cardinality of a minimal forbidden graph family for reducible additive hereditary graph properties. 263-274 - Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On odd and semi-odd linear partitions of cubic graphs. 275-292 - Jean-Luc Fouquet, Jean-Marie Vanherpe:
On normal partitions in cubic graphs. 293-312 - Hortensia Galeana-Sánchez, Martín Manrique:
Directed hypergraphs: A tool for researching digraphs and hypergraphs. 313-335 - Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, B. Zavala:
Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs. 337-347 - Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, B. Zavala:
Monochromatic paths and monochromatic sets of arcs in bipartite tournaments. 349-360 - Krzysztof Giaro, Marek Kubale:
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs. 361-376 - Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer:
On F-independence in graphs. 377-383 - Dávid Hudák, Tomás Madaras:
On local structure of 1-planar graphs of minimum degree 5 and girth 4. 385-400 - Peter Mihók, Jozef Miskuf, Gabriel Semanisin:
On universal graphs for hom-properties. 401-409 - Rahul Muthu, N. Narayanan, C. R. Subramanian:
On k-intersection edge colourings. 411-418
Volume 29, Number 3, 2009
- Michael Andresen:
On transitive orientations of G-e. 423-467 - Hortensia Galeana-Sánchez, Ricardo Gómez, Juan José Montellano-Ballesteros:
Independent transversals of longest paths in locally semicomplete and transitive digraphs. 469-480 - Lixia Fan, Zhihe Liang:
On Lee's conjecture and some results. 481-498 - Xinhui An, Baoyindureng Wu:
List linear arboricity of planar graphs. 499-510 - Alberto Castejón, Mikhail I. Ostrovskii:
Minimum congestion spanning trees of grids and discrete toruses. 511-519 - Július Czap, Stanislav Jendrol':
Colouring vertices of plane graphs under restrictions given by faces. 521-543 - Gary Chartrand, Futaba Okamoto, Craig W. Rasmussen, Ping Zhang:
The set chromatic number of a graph. 545-561 - Mariusz Meszka, Zdzislaw Skupien:
Decompositions of nearly complete digraphs into t isomorphic parts. 563-572 - Aneta Dudek, Malgorzata Zwonek:
(H, k) stable bipartite graphs with the minimum size. 573-581 - Michael J. Ferrara, Michael S. Jacobson, John R. Schmitt, Mark H. Siggers:
Potentially H-bigraphic sequences. 583-596 - Mustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann:
Bounds on the global offensive k-alliance number in graphs. 597-613 - Wlodzimierz Ulatowski:
Relations between the domination parameters and the chromatic index of a graph. 615-627 - Y. M. Borse, Kiran Dalvi, M. M. Shikare:
Forbidden-minor characterization for the class of graphic element splitting matroids. 629-644 - Takeshi Sugiyama, Masao Tsugaki:
Pairs of forbidden class of subgraphs concerning K1, 3 and P6 to have a cycle containing specified vertices. 645-650 - Pawel Naroski:
Packing of nonuniform hypergrahs- product and sum of sizes conditions. 651-656
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 22:09 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:
