bwmeta1.element.issn-2083-5892, Tome 27 (2007)

Sommaire

Grundy number of graphs

Brice Effantin ; Hamamache Kheddouci

Access to full text
Full (PDF)

p. 5-18

The Polish Digital Mathematics Library

Global alliances and independence in trees

Mustapha Chellali ; Teresa W. Haynes

Access to full text
Full (PDF)

p. 19-27

The Polish Digital Mathematics Library

New sufficient conditions for hamiltonian and pancyclic graphs

Ingo Schiermeyer ; Mariusz Woźniak

Access to full text
Full (PDF)

p. 29-38

The Polish Digital Mathematics Library

A note on uniquely H-colourable graphs

Anthony Bonato

Access to full text
Full (PDF)

p. 39-44

The Polish Digital Mathematics Library

A note on packing of two copies of a hypergraph

Monika Pilśniak ; Mariusz Woźniak

Access to full text
Full (PDF)

p. 45-49

The Polish Digital Mathematics Library

Digraphs with isomorphic underlying and domination graphs: connected

U G^{c} (d)

Kim A.S. Factor ; Larry J. Langley

Access to full text
Full (PDF)

p. 51-67

The Polish Digital Mathematics Library

Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two

Shi-Cai Gong ; Yi-Zheng Fan

Access to full text
Full (PDF)

p. 69-82

The Polish Digital Mathematics Library

Trees with equal restrained domination and total restrained domination numbers

Joanna Raczek

Access to full text
Full (PDF)

p. 83-91

The Polish Digital Mathematics Library

Characterization of block graphs with equal 2-domination number and domination number plus one

Adriana Hansberg ; Lutz Volkmann

Access to full text
Full (PDF)

p. 93-103

The Polish Digital Mathematics Library

Linear and cyclic radio k-labelings of trees

Mustapha Kchikech ; Riadh Khennoufa ; Olivier Togni

Access to full text
Full (PDF)

p. 105-123

The Polish Digital Mathematics Library

Orientation distance graphs revisited

Wayne Goddard ; Kiran Kanakadandi

Access to full text
Full (PDF)

p. 125-136

The Polish Digital Mathematics Library

A new upper bound for the chromatic number of a graph

Ingo Schiermeyer

Access to full text
Full (PDF)

p. 137-142

The Polish Digital Mathematics Library

Spectral study of alliances in graphs

Juan Alberto Rodríguez-Velazquez ; Jose Maria Sigarreta Almira

Access to full text
Full (PDF)

p. 143-157

The Polish Digital Mathematics Library

Improved upper bounds for nearly antipodal chromatic number of paths

Yu-Fa Shen ; Guo-Ping Zheng ; Wen-Jie HeK

Access to full text
Full (PDF)

p. 159-174

The Polish Digital Mathematics Library

Total domination of Cartesian products of graphs

Xinmin Hou

Access to full text
Full (PDF)

p. 175-178

The Polish Digital Mathematics Library

Cycles through specified vertices in triangle-free graphs

Daniel Paulusma ; Kiyoshi Yoshimoto

Access to full text
Full (PDF)

p. 179-191

The Polish Digital Mathematics Library

More on even [a,b]-factors in graphs

Abdollah Khodkar ; Rui Xu

Access to full text
Full (PDF)

p. 193-204

The Polish Digital Mathematics Library

On distance local connectivity and vertex distance colouring

Přemysl Holub

Access to full text
Full (PDF)

p. 209-227

The Polish Digital Mathematics Library

Variations on a sufficient condition for Hamiltonian graphs

Ahmed Ainouche ; Serge Lapiquonne

Access to full text
Full (PDF)

p. 229-240

The Polish Digital Mathematics Library

Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails

Sylwia Cichacz

Access to full text
Full (PDF)

p. 241-249

The Polish Digital Mathematics Library

Further results on sequentially additive graphs

Suresh Manjanath Hegde ; Mirka Miller

Access to full text
Full (PDF)

p. 251-268

The Polish Digital Mathematics Library

Erdős regular graphs of even degree

Andrey A. Dobrynin ; Leonid S. Mel'nikov ; Artem V. Pyatkin

Access to full text
Full (PDF)

p. 269-279

The Polish Digital Mathematics Library

Subgraph densities in hypergraphs

Yuejian Peng

Access to full text
Full (PDF)

p. 281-297

The Polish Digital Mathematics Library

Infinite families of tight regular tournaments

Bernardo Llano ; Mika Olsen

Access to full text
Full (PDF)

p. 299-311

The Polish Digital Mathematics Library

On θ-graphs of partial cubes

Sandi Klavžar ; Matjaz Kovse

Access to full text
Full (PDF)

p. 313-321

The Polish Digital Mathematics Library

Vertex-dominating cycles in 2-connected bipartite graphs

Tomoki Yamashita

Access to full text
Full (PDF)

p. 323-332

The Polish Digital Mathematics Library

Edge-connectivity of strong products of graphs

Bostjan Bresar ; Simon Spacapan

Access to full text
Full (PDF)

p. 333-343

The Polish Digital Mathematics Library

Histories in path graphs

Ludovít Niepel

Access to full text
Full (PDF)

p. 345-357

The Polish Digital Mathematics Library

(k,l)-kernels, (k,l)-semikernels, k-Grundy functions and duality for state splittings

Hortensia Galeana-Sánchez ; Ricardo Gómez

Access to full text
Full (PDF)

p. 359-371

The Polish Digital Mathematics Library

On the second largest eigenvalue of a mixed graph

Jun Zhou ; Yi-Zheng Fan ; Yi Wang

Access to full text
Full (PDF)

p. 373-384

The Polish Digital Mathematics Library

Monochromatic kernel-perfectness of special classes of digraphs

Hortensia Galeana-Sánchez ; Luis Alberto Jiménez Ramírez

Access to full text
Full (PDF)

p. 389-400

The Polish Digital Mathematics Library

The Chvátal-Erdős condition and 2-factors with a specified number of components

Guantao Chen ; Ronald J. Gould ; Ken-ichi Kawarabayashi ; Katsuhiro Ota ; Akira Saito ; Ingo Schiermeyer

Access to full text
Full (PDF)

p. 401-407

The Polish Digital Mathematics Library

Efficient (j,k)-domination

Robert R. Rubalcaba ; Peter J. Slater

Access to full text
Full (PDF)

p. 409-423

The Polish Digital Mathematics Library

Some totally 4-choosable multigraphs

Douglas R. Woodall

Access to full text
Full (PDF)

p. 425-455

The Polish Digital Mathematics Library

On (k,l)-kernels in D-join of digraphs

Waldemar Szumny ; Andrzej Włoch ; Iwona Włoch

Access to full text
Full (PDF)

p. 457-470

The Polish Digital Mathematics Library

Towards a characterization of bipartite switching classes by means of forbidden subgraphs

Jurriaan Hage ; Tero Harju

Access to full text
Full (PDF)

p. 471-483

The Polish Digital Mathematics Library

Distance defined by spanning trees in graphs

Gary Chartrand ; Ladislav Nebeský ; Ping Zhang

Access to full text
Full (PDF)

p. 485-506

The Polish Digital Mathematics Library

The structure and existence of 2-factors in iterated line graphs

Michael Ferrara ; Ronald J. Gould ; Stephen G. Hartke

Access to full text
Full (PDF)

p. 507-526

The Polish Digital Mathematics Library

Counterexample to a conjecture on the structure of bipartite partitionable graphs

Richard G. Gibson ; Christina M. Mynhardt

Access to full text
Full (PDF)

p. 527-540

The Polish Digital Mathematics Library

Fractional domination in prisms

Matthew Walsh

Access to full text
Full (PDF)

p. 541-547

The Polish Digital Mathematics Library

A proof of the crossing number of

K_{3, n}

in a surface

Pak Tung Ho

Access to full text
Full (PDF)

p. 549-551

The Polish Digital Mathematics Library

An approximation algorithm for the total covering problem

Pooya Hatami

Access to full text
Full (PDF)

p. 553-558

The Polish Digital Mathematics Library

Preface to proceedings

W. Frydrych ; A. Żak

Access to full text
Full (PDF)

p. 559

The Polish Digital Mathematics Library

'3in1' enhanced: three squared ways to '3in1' GRAPHS

Zdzisław Skupień

Access to full text
Full (PDF)

p. 561-563

The Polish Digital Mathematics Library

The representation of multi-hypergraphs by set intersections

Stanisław Bylka ; Jan Komar

Access to full text
Full (PDF)

p. 565-582

The Polish Digital Mathematics Library

Magic and supermagic dense bipartite graphs

Jaroslav Ivanco

Access to full text
Full (PDF)

p. 583-591

The Polish Digital Mathematics Library

Factoring directed graphs with respect to the cardinal product in polynomial time

Wilfried Imrich ; Werner Klöckl

Access to full text
Full (PDF)

p. 593-601

The Polish Digital Mathematics Library

Minimal non-selfcentric radially-maximal graphs of radius 4

Martin Knor

Access to full text
Full (PDF)

p. 603-610

The Polish Digital Mathematics Library

A Sokoban-type game and arc deletion within irregular digraphs of all sizes

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

Access to full text
Full (PDF)

p. 611-622

The Polish Digital Mathematics Library