Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Discussiones Mathematicae. Graph Theory
Tome 26 (2006)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Algorithmic aspects of total-subdomination in graphs
Harris, Laura
;
Hattingh, Johannes
;
Henning, Michael
p. 5-18
An anti-Ramsey theorem on edge-cuts
Montellano-Ballesteros, Juan
p. 19-21
Extension of several sufficient conditions for Hamiltonian graphs
Ainouche, Ahmed
p. 23-39
A characterization of planar median graphs
Peterin, Iztok
p. 41-48
Spectral integral variation of trees
Wang, Yi
;
Fan, Yi-Zheng
p. 49-58
Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph
Mojdeh, D.
p. 59-72
Chvátal's Condition cannot hold for both a graph and its complement
Kostochka, Alexandr
;
West, Douglas
p. 73-76
Leaps: an approach to the block structure of a graph
Mulder, Henry
;
Nebeský, Ladislav
p. 77-90
The use of Euler's formula in (3,1)*-list coloring
Zhao, Yongqiang
;
He, Wenjie
p. 91-101
Some results on total domination in direct products of graphs
Dorbec, Paul
;
Gravier, Sylvain
;
Klavžar, Sandi
;
Spacapan, Simon
p. 103-112
On the basis number and the minimum cycle bases of the wreath product of some graphs i
Jaradat, Mohammed
p. 113-134
A prime factor theorem for a generalized direct product
Imrich, Wilfried
;
Stadler, Peter
p. 135-140
Decomposing complete graphs into cubes
El-Zanati, Saad
;
Eynden, C.
p. 141-147
Optimal edge ranking of complete bipartite graphs in polynomial time
Hung, Ruo-Wei
p. 149-159
Wiener index of generalized stars and their quadratic line graphs
Dobrynin, Andrey
;
Mel'nikov, Leonid
p. 161-175
Sommaire du
Fascicule no. 2
Extremal bipartite graphs with a unique k-factor
Hoffmann, Arne
;
Sidorowicz, Elżbieta
;
Volkmann, Lutz
p. 181-192
In-degree sequence in a general model of a random digraph
Palka, Zbigniew
;
Sperling, Monika
p. 193-207
A lower bound for the irredundance number of trees
Poschen, Michael
;
Volkmann, Lutz
p. 209-215
Self-complementary hypergraphs
Wojda, A.
p. 217-224
An upper bound for maximum number of edges in a strongly multiplicative graph
Adiga, Chandrashekar
;
Smitha, Mahadev
p. 225-229
Isomorphic components of direct products of bipartite graphs
Hammack, Richard
p. 231-248
On stratification and domination in graphs
Gera, Ralucca
;
Zhang, Ping
p. 249-272
On a perfect problem
Zverovich, Igor
p. 273-277
Preface to proceedings
Frydrych, W.
;
Żak, A.
p. 279
On uniquely partitionable relational structures and object systems
Bucko, Jozef
;
Mihók, Peter
p. 281-289
Arbitrarily vertex decomposable caterpillars with four or five leaves
Cichacz, Sylwia
;
Görlich, Agnieszka
;
Marczyk, Antoni
;
Przybyło, Jakub
;
Woźniak, Mariusz
p. 291-305
Graphs with convex domination number close to their order
Cyman, Joanna
;
Lemańska, Magdalena
;
Raczek, Joanna
p. 307-316
Extremum degree sets of irregular oriented graphs and pseudodigraphs
Dziechcińska-Halamoda, Zyta
;
Majcher, Zofia
;
Michael, Jerzy
;
Skupień, Zdzisław
p. 317-333
Chvátal-Erdos condition and pancyclism
Flandrin, Evelyne
;
Li, Hao
;
Marczyk, Antoni
;
Schiermeyer, Ingo
;
Woźniak, Mariusz
p. 335-342
Orthogonal double covers of complete graphs by fat caterpillars
Froncek, Dalibor
;
Leck, Uwe
p. 343-349
Problem presented at the workshop in Krynica 2004
Kubesa, Michael
;
Froncek, Dalibor
p. 351
Sommaire du
Fascicule no. 3
Arc-transitive and s-regular Cayley graphs of valency five on Abelian groups
Alaeiyan, Mehdi
p. 359-368
The cost chromatic number and hypergraph parameters
Bacsó, Gábor
;
Tuza, Zsolt
p. 369-376
On partitions of hereditary properties of graphs
Borowiecki, Mieczysław
;
Fiedorowicz, Anna
p. 377-387
On-line -coloring of graphs
Borowiecki, Piotr
p. 389-401
On arbitrarily vertex decomposable unicyclic graphs with dominating cycle
Cichacz, Sylwia
;
Zioło, Irmina
p. 403-412
A note on joins of additive hereditary graph properties
Drgas-Burchardt, Ewa
p. 413-418
The upper domination Ramsey number u(4,4)
Dzido, Tomasz
;
Zakrzewska, Renata
p. 419-430
A lower bound on the independence number of a graph in terms of degrees
Harant, Jochen
;
Schiermeyer, Ingo
p. 431-437
Combinatorial lemmas for polyhedrons I
Idzik, Adam
;
Junosza-Szaniawski, Konstanty
p. 439-338
Total edge irregularity strength of trees
Ivančo, Jaroslav
;
Jendrol', Stanislav
p. 449-456
Some recent results on domination in graphs
Plummer, Michael
p. 457-474