default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 25
Volume 25, Number 1-2, 2005
- Mieczyslaw Borowiecki:
Preface. 5 - Frank Göring
, Jochen Harant:
On Domination in Graphs. 7-12 - Michael A. Henning:
Graphs with double domination numbers. 13-28 - Jochen Harant, Michael A. Henning:
On Double Domination in Graphs. 29-34 - Douglas F. Rall:
Total Domination in Categorical Products of Graphs. 35-44 - Izolda Gorgol:
Planar Ramsey Numbers. 45-50 - Magdalena Lemanska:
Domination Numbers in Graphs with Removed Edge or Set of Edges. 51-56 - Tomasz Dzido:
Multicolor Ramsey Numbers for Paths and Cycles. 57-65 - Ewa Drgas-Burchardt, Anna Fiedorowicz:
Maximal Hypergraphs with Respect to the Bounded Cost Hereditary Property. 67-77 - Maciej Zwierzchowski:
Note on Split Domination Number of the Cartesian Product of Paths. 79-84 - Gábor Bacsó, Danuta Michalak, Zsolt Tuza:
Dominating Bipartite Subgraphs in Graphs. 85-94 - Adam Idzik, Konstanty Junosza-Szaniawski:
Combinatorial Lemmas for Polyhedrons. 95-102 - Magdalena Kucharska:
On (k, l)-perfectnees of Special Classes of Digraphs. 103-119 - Gábor Bacsó, Attila Tálos, Zsolt Tuza:
Graph Domination in Distance Two. 121-128 - Ingo Schiermeyer:
The Cycle-Complete Graph Ramsey Number r(C5, K7). 129-139 - Andrzej Kurek, Andrzej Rucinski:
Two variants of the size Ramsey number. 141-149 - Peter Jacko, Stanislav Jendrol':
Distance Coloring of the Hexagonal Lattice. 151-166 - Stanislaw Bylka:
Arithmetically maximal independent sets in infinite graphs. 167-182 - Bostjan Bresar, Pranava K. Jha, Sandi Klavzar, Blaz Zmazek:
Median and quasi-median direct products of graphs. 183-196 - Marián Klesc:
Some crossing numbers of products of cycles. 197-210 - Izak Broere, Jozef Bucko, Bonita S. Wilson:
Note on partitions of planar graphs. 211-215
- Adam Idzik:
Estimation of cut-vertices in edge-coloured complete graphs. 217-218 - Konstanty Junosza-Szaniawski:
Coloring of G2-G, for Euclidesian graph G. 219
Volume 25, Number 3, 2005
- Yair Caro, William Klostermeyer, Raphael Yuster:
Connected odd dominating sets in graphs. 225-239 - Nancy E. Clarke, Richard J. Nowakowski:
A Tandem version of the Cops and Robber Game played on products of graphs. 241-249 - Anders Sune Pedersen:
Domination and leaf density in graphs. 251-259 - Tomislav Doslic:
Mycielskians and matchings. 261-266 - Shinya Fujita:
On graphs G for which both G and 'G are claw-free. 267-272 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs. 273-289 - Mustapha Chellali, Abdelkader Khelladi, Frédéric Maffray:
Exact double domination in graphs. 291-302 - Dawid A. Pike:
Hamilton decompositions of line graphs of some bipartite graphs. 303-310 - Michael Kubesa:
Trees with Α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees. 311-324 - Zdzislaw Skupien:
Decompositions into two paths. 325-329 - Marietjie Frick, Susan A. van Aardt, Gcina Dlamini, Jean E. Dunbar, Ortrud R. Oellermann:
The directed path partition conjecture. 331-343 - Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid:
On a conjecture of Quintas and arc-traceability in upset tournaments. 345-354 - Mostafa Blidia, Mustapha Chellali, Lutz Volkmann:
On the p-domination number of cactus graphs. 355-361 - Gary Chartrand, David Erwin, Donald W. VanderJagt, Ping Zhang:
On γ-labelings of trees. 363-383 - Jozef Bucko, Peter Mihók, Jean-François Saclé, Mariusz Wozniak:
A note on maximal common subgraphs of the Dirac's family of graphs. 385-390 - Mohammed M. M. Jaradat:
An upper bound of the basis number of the strong product of graphs. 391-406 - Hortensia Galeana-Sánchez, Laura Pastrana Ramírez, Hugo Alberto Rincón-Mejía:
Kernels in monochromatic path digraphs. 407-417 - Erhard Hexel:
On short cycles through prescribed vertices of a polyhedral graph. 419-426 - Zbigniew Palka, Monika Sperling:
On a sphere of influence graph in a one-dimensional space. 427-433 - Zsolt Tuza:
Highly connected counterexamples to a conjecture on ά -domination. 435-440
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:
