Sommaire

Algorithmic aspects of total-subdomination in graphs

Laura M. Harris ; Johannes H. Hattingh ; Michael A. Henning

Access to full text
Full (PDF)
p. 5-18

The Polish Digital Mathematics Library
An anti-Ramsey theorem on edge-cuts

Juan José Montellano-Ballesteros

Access to full text
Full (PDF)
p. 19-21

The Polish Digital Mathematics Library
Extension of several sufficient conditions for Hamiltonian graphs

Ahmed Ainouche

Access to full text
Full (PDF)
p. 23-39

The Polish Digital Mathematics Library
A characterization of planar median graphs

Iztok Peterin

Access to full text
Full (PDF)
p. 41-48

The Polish Digital Mathematics Library
Spectral integral variation of trees

Yi Wang ; Yi-Zheng Fan

Access to full text
Full (PDF)
p. 49-58

The Polish Digital Mathematics Library
Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph

D. Ali Mojdeh

Access to full text
Full (PDF)
p. 59-72

The Polish Digital Mathematics Library
Chvátal's Condition cannot hold for both a graph and its complement

Alexandr V. Kostochka ; Douglas B. West

Access to full text
Full (PDF)
p. 73-76

The Polish Digital Mathematics Library
Leaps: an approach to the block structure of a graph

Henry Martyn Mulder ; Ladislav Nebeský

Access to full text
Full (PDF)
p. 77-90

The Polish Digital Mathematics Library
The use of Euler's formula in (3,1)*-list coloring

Yongqiang Zhao ; Wenjie He

Access to full text
Full (PDF)
p. 91-101

The Polish Digital Mathematics Library
Some results on total domination in direct products of graphs

Paul Dorbec ; Sylvain Gravier ; Sandi Klavžar ; Simon Spacapan

Access to full text
Full (PDF)
p. 103-112

The Polish Digital Mathematics Library
On the basis number and the minimum cycle bases of the wreath product of some graphs i

Mohammed M.M. Jaradat

Access to full text
Full (PDF)
p. 113-134

The Polish Digital Mathematics Library
A prime factor theorem for a generalized direct product

Wilfried Imrich ; Peter F. Stadler

Access to full text
Full (PDF)
p. 135-140

The Polish Digital Mathematics Library
Decomposing complete graphs into cubes

Saad I. El-Zanati ; C. Vanden Eynden

Access to full text
Full (PDF)
p. 141-147

The Polish Digital Mathematics Library
Optimal edge ranking of complete bipartite graphs in polynomial time

Ruo-Wei Hung

Access to full text
Full (PDF)
p. 149-159

The Polish Digital Mathematics Library
Wiener index of generalized stars and their quadratic line graphs

Andrey A. Dobrynin ; Leonid S. Mel'nikov

Access to full text
Full (PDF)
p. 161-175

The Polish Digital Mathematics Library
Extremal bipartite graphs with a unique k-factor

Arne Hoffmann ; Elżbieta Sidorowicz ; Lutz Volkmann

Access to full text
Full (PDF)
p. 181-192

The Polish Digital Mathematics Library
In-degree sequence in a general model of a random digraph

Zbigniew Palka ; Monika Sperling

Access to full text
Full (PDF)
p. 193-207

The Polish Digital Mathematics Library
A lower bound for the irredundance number of trees

Michael Poschen ; Lutz Volkmann

Access to full text
Full (PDF)
p. 209-215

The Polish Digital Mathematics Library
Self-complementary hypergraphs

A. Paweł Wojda

Access to full text
Full (PDF)
p. 217-224

The Polish Digital Mathematics Library
An upper bound for maximum number of edges in a strongly multiplicative graph

Chandrashekar Adiga ; Mahadev Smitha

Access to full text
Full (PDF)
p. 225-229

The Polish Digital Mathematics Library
Isomorphic components of direct products of bipartite graphs

Richard Hammack

Access to full text
Full (PDF)
p. 231-248

The Polish Digital Mathematics Library
On stratification and domination in graphs

Ralucca Gera ; Ping Zhang

Access to full text
Full (PDF)
p. 249-272

The Polish Digital Mathematics Library
On a perfect problem

Igor E. Zverovich

Access to full text
Full (PDF)
p. 273-277

The Polish Digital Mathematics Library
Preface to proceedings

W. Frydrych ; A. Żak

Access to full text
Full (PDF)
p. 279

The Polish Digital Mathematics Library
On uniquely partitionable relational structures and object systems

Jozef Bucko ; Peter Mihók

Access to full text
Full (PDF)
p. 281-289

The Polish Digital Mathematics Library
Arbitrarily vertex decomposable caterpillars with four or five leaves

Sylwia Cichacz ; Agnieszka Görlich ; Antoni Marczyk ; Jakub Przybyło ; Mariusz Woźniak

Access to full text
Full (PDF)
p. 291-305

The Polish Digital Mathematics Library
Graphs with convex domination number close to their order

Joanna Cyman ; Magdalena Lemańska ; Joanna Raczek

Access to full text
Full (PDF)
p. 307-316

The Polish Digital Mathematics Library
Extremum degree sets of irregular oriented graphs and pseudodigraphs

Zyta Dziechcińska-Halamoda ; Zofia Majcher ; Jerzy Michael ; Zdzisław Skupień

Access to full text
Full (PDF)
p. 317-333

The Polish Digital Mathematics Library
Chvátal-Erdos condition and pancyclism

Evelyne Flandrin ; Hao Li ; Antoni Marczyk ; Ingo Schiermeyer ; Mariusz Woźniak

Access to full text
Full (PDF)
p. 335-342

The Polish Digital Mathematics Library
Orthogonal double covers of complete graphs by fat caterpillars

Dalibor Froncek ; Uwe Leck

Access to full text
Full (PDF)
p. 343-349

The Polish Digital Mathematics Library
Problem presented at the workshop in Krynica 2004

Michael Kubesa ; Dalibor Froncek

Access to full text
Full (PDF)
p. 351

The Polish Digital Mathematics Library
Preface

Access to full text
Full (PDF)
p. 357

The Polish Digital Mathematics Library
Arc-transitive and s-regular Cayley graphs of valency five on Abelian groups

Mehdi Alaeiyan

Access to full text
Full (PDF)
p. 359-368

The Polish Digital Mathematics Library
The cost chromatic number and hypergraph parameters

Gábor Bacsó ; Zsolt Tuza

Access to full text
Full (PDF)
p. 369-376

The Polish Digital Mathematics Library
On partitions of hereditary properties of graphs

Mieczysław Borowiecki ; Anna Fiedorowicz

Access to full text
Full (PDF)
p. 377-387

The Polish Digital Mathematics Library
On-line 𝓟-coloring of graphs

Piotr Borowiecki

Access to full text
Full (PDF)
p. 389-401

The Polish Digital Mathematics Library
On arbitrarily vertex decomposable unicyclic graphs with dominating cycle

Sylwia Cichacz ; Irmina A. Zioło

Access to full text
Full (PDF)
p. 403-412

The Polish Digital Mathematics Library
A note on joins of additive hereditary graph properties

Ewa Drgas-Burchardt

Access to full text
Full (PDF)
p. 413-418

The Polish Digital Mathematics Library
The upper domination Ramsey number u(4,4)

Tomasz Dzido ; Renata Zakrzewska

Access to full text
Full (PDF)
p. 419-430

The Polish Digital Mathematics Library
A lower bound on the independence number of a graph in terms of degrees

Jochen Harant ; Ingo Schiermeyer

Access to full text
Full (PDF)
p. 431-437

The Polish Digital Mathematics Library
Combinatorial lemmas for polyhedrons I

Adam Idzik ; Konstanty Junosza-Szaniawski

Access to full text
Full (PDF)
p. 439-338

The Polish Digital Mathematics Library
Total edge irregularity strength of trees

Jaroslav Ivančo ; Stanislav Jendrol'

Access to full text
Full (PDF)
p. 449-456

The Polish Digital Mathematics Library
Some recent results on domination in graphs

Michael D. Plummer

Access to full text
Full (PDF)
p. 457-474

The Polish Digital Mathematics Library