default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 26
Volume 26, Number 1, 2006
- Laura M. Harris, Johannes H. Hattingh, Michael A. Henning:
Algorithmic aspects of total k-subdomination in graphs. 5-18 - Juan José Montellano-Ballesteros:
An anti-Ramsey Theorem on edge-cutsets. 19-21 - Ahmed Ainouche:
Extension of several sufficient conditions for Hamiltonian graphs. 23-39 - Iztok Peterin:
A charaterization of planar median graphs. 41-48 - Yi-Zheng Fan, Yi Wang:
Special integral variation of trees. 49-58 - Doostali Mojdeh
:
Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph. 59-72 - Alexandr V. Kostochka, Douglas B. West:
Chvátal's Condition cannot hold for both a graph and its complement. 73-76 - Henry Martyn Mulder, Ladislav Nebesky:
Leaps: an approach to the block structure of a graph. 77-90 - Wenjie He, Yufa Shen, Yongqiang Zhao:
The use of Euler's formula in (3, 1)*-list-coloring. 91-101 - Paul Dorbec, Sylvain Gravier, Sandi Klavzar, Simon Spacapan:
Some results on total domination in direct products of graphs. 103-112 - Mohammed M. M. Jaradat:
On the basic number and the minimum cycle bases of the wreath product of some graphs I. 113-134 - Wilfried Imrich, Peter F. Stadler:
A prime factor theorem for a generalized direct product. 135-140 - Saad I. El-Zanati, Charles Vanden Eynden:
Decomposing complete graphs into cubes. 141-147 - Ruo-Wei Hung:
Optimal edge ranking of complete bipartite graphs in polynomial time. 149-159 - Andrey A. Dobrynin, Leonid S. Melnikov:
Wiener index of generalized stars and their quadratic line graphs. 161-175
Volume 26, Number 2, 2006
- Arne Hoffmann, Elzbieta Sidorowicz, Lutz Volkmann:
Extremal bipartite graphs with a unique k-factor. 181-192 - Zbigniew Palka, Monika Sperling:
In-degree sequence in a general model of a random digraph. 193-207 - Michael Poschen, Lutz Volkmann:
A lower bound for the irredundance number of trees. 209-215 - A. Pawel Wojda:
Self-complementary hypergraphs. 217-224 - Chandrashekar Adiga, Mahadev Smitha:
An upper bound for maximum number of edges in a strongly multiplicative graph. 225-229 - Richard H. Hammack:
Isomorphic components of direct products of bipartite graphs. 231-248 - Ralucca Gera, Ping Zhang:
On stratification and domination in graphs. 249-272 - Igor E. Zverovich:
On a perfect problem. 273-277 - Waclaw Frydrych, Andrzej Zak:
Preface to proceedings. 279- - Jozef Bucko, Peter Mihók:
On uniquely partitionable relational structures and object systems. 281-289 - Sylwia Cichacz, Agnieszka Görlich, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak:
Arbitrarily vertex decomposable caterpillars with four or five leaves. 291-305 - Joanna Cyman, Magdalena Lemanska, Joanna Raczek:
Graphs with convex domination number close to their order. 307-316 - Zyta Dziechcinska-Halamoda, Zofia Majcher, Jerzy Michael, Zdzislaw Skupien:
Extremum degree sets of irregular oriented graphs and pseudodigraphs. 317-333 - Evelyne Flandrin, Hao Li, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak:
Chvátal-Erdös condition and pancyclism. 335-342 - Dalibor Froncek, Uwe Leck:
Orthogonal double covers of complete graphs by fat catepillars. 343-349
- Michael Kubesa, Dalibor Froncek:
Problem presented at the workshop in Krynica 2004. 351
Volume 26, Number 3, 2006
- Mieczyslaw Borowiecki:
Preface. 357 - Mehdi Alaeiyan:
Arc-transitive and s-regular Cayley graphs of valency 5 on Abelian groups. 359-368 - Gábor Bacsó, Zsolt Tuza:
The cost chromatic number and hypergraph parameters. 369-376 - Mieczyslaw Borowiecki, Anna Fiedorowicz:
On partitions of hereditary properties of graphs. 377-387 - Piotr Borowiecki:
On-line P-coloring of graphs. 389-401 - Sylwia Cichacz, Irmina A. Ziolo:
On arbitraly vertex decomposable unicyclic graphs with dominating cycle. 403-412 - Ewa Drgas-Burchardt:
Joins of additive hereditary graph properties. 413-418 - Tomasz Dzido, Renata Zakrzewska:
The upper domination Ramsey number u(4, 4). 419-430 - Jochen Harant, Ingo Schiermeyer:
A lower bound on the independence number of a graph in terms of degrees. 431-437 - Adam Idzik, Konstanty Junosza-Szaniawski:
Combinatorial lemmas for polyhedrons I. 439-448 - Jaroslav Ivanco, Stanislav Jendrol':
Total edge irregularity strength of trees. 449-456 - Michael D. Plummer:
Some recent results on domination in graphs. 457-474
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-23 00:33 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:
