bwmeta1.element.issn-2083-5892, Tome 28 (2008)

Sommaire

Competition hypergraphs of digraphs with certain properties I. Strong connectedness

Martin Sonntag ; Hanns-Martin Teichert

Access to full text
Full (PDF)

p. 5-21

The Polish Digital Mathematics Library

Competition hypergraphs of digraphs with certain properties II. Hamiltonicity

Martin Sonntag ; Hanns-Martin Teichert

Access to full text
Full (PDF)

p. 23-34

The Polish Digital Mathematics Library

Recognizable colorings of graphs

Gary Chartrand ; Linda Lesniak ; Donald W. VanderJagt ; Ping Zhang

Access to full text
Full (PDF)

p. 35-57

The Polish Digital Mathematics Library

Trees with equal total domination and total restrained domination numbers

Xue-Gang Chen ; Wai Chee Shiu ; Hong-Yu Chen

Access to full text
Full (PDF)

p. 59-66

The Polish Digital Mathematics Library

A classification for maximal nonhamiltonian Burkard-Hammer graphs

Ngo Dac Tan ; Chawalit Iamjaroen

Access to full text
Full (PDF)

p. 67-89

The Polish Digital Mathematics Library

An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles

Tomás Vetrík

Access to full text
Full (PDF)

p. 91-96

The Polish Digital Mathematics Library

Partitions of a graph into cycles containing a specified linear forest

Ryota Matsubara ; Hajime Matsumura

Access to full text
Full (PDF)

p. 97-107

The Polish Digital Mathematics Library

Weakly connected domination subdivision numbers

Joanna Raczek

Access to full text
Full (PDF)

p. 109-119

The Polish Digital Mathematics Library

Paths of low weight in planar graphs

Igor Fabrici ; Jochen Harant ; Stanislav Jendrol'

Access to full text
Full (PDF)

p. 121-135

The Polish Digital Mathematics Library

(H,k) stable graphs with minimum size

Aneta Dudek ; Artur Szymański ; Małgorzata Zwonek

Access to full text
Full (PDF)

p. 137-149

The Polish Digital Mathematics Library

Maximal k-independent sets in graphs

Mostafa Blidia ; Mustapha Chellali ; Odile Favaron ; Nacéra Meddah

Access to full text
Full (PDF)

p. 151-163

The Polish Digital Mathematics Library

Radio k-labelings for Cartesian products of graphs

Mustapha Kchikech ; Riadh Khennoufa ; Olivier Togni

Access to full text
Full (PDF)

p. 165-178

The Polish Digital Mathematics Library

A cancellation property for the direct product of graphs

Richard H. Hammack

Access to full text
Full (PDF)

p. 179-184

The Polish Digital Mathematics Library

The chromatic equivalence class of graph

\bar{B_{n - 6, 1, 2}}

Jianfeng Wang ; Qiongxiang Huang ; Chengfu Ye ; Ruying Liu

Access to full text
Full (PDF)

p. 189-218

The Polish Digital Mathematics Library

The Wiener number of Kneser graphs

Rangaswami Balakrishnan ; S. Francis Raj

Access to full text
Full (PDF)

p. 219-228

The Polish Digital Mathematics Library

Minimal cycle bases of the lexicographic product of graphs

M.M.M. Jaradat

Access to full text
Full (PDF)

p. 229-247

The Polish Digital Mathematics Library

On the structure of path-like trees

F.A. Muntaner-Batle ; Miquel Rius-Font

Access to full text
Full (PDF)

p. 249-265

The Polish Digital Mathematics Library

Secure domination and secure total domination in graphs

William F. Klostermeyer ; Christina M. Mynhardt

Access to full text
Full (PDF)

p. 267-284

The Polish Digital Mathematics Library

Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments

Hortensia Galeana-Sanchez ; Rocío Rojas-Monroy

Access to full text
Full (PDF)

p. 285-306

The Polish Digital Mathematics Library

Clique irreducibility of some iterative classes of graphs

Aparna Lakshmanan S. ; A. Vijayakumar

Access to full text
Full (PDF)

p. 307-321

The Polish Digital Mathematics Library

On acyclic colorings of direct products

Simon Špacapan ; Aleksandra Tepeh Horvat

Access to full text
Full (PDF)

p. 323-333

The Polish Digital Mathematics Library

A note on domination parameters in random graphs

Anthony Bonato ; Changping Wang

Access to full text
Full (PDF)

p. 335-343

The Polish Digital Mathematics Library

An upper bound on the Laplacian spectral radius of the signed graphs

Hong-Hai Li ; Jiong-Sheng Li

Access to full text
Full (PDF)

p. 345-359

The Polish Digital Mathematics Library

A remark on the (2,2)-domination number

Torsten Korneffel ; Dirk Meierling ; Lutz Volkmann

Access to full text
Full (PDF)

p. 361-366

The Polish Digital Mathematics Library

Ordered and linked chordal graphs

Thomas Böhme ; Tobias Gerlach ; Michael Stiebitz

Access to full text
Full (PDF)

p. 367-373

The Polish Digital Mathematics Library

Solution to the problem of Kubesa

Mariusz Meszka

Access to full text
Full (PDF)

p. 375-378

The Polish Digital Mathematics Library

On locating and differentiating-total domination in trees

Mustapha Chellali

Access to full text
Full (PDF)

p. 383-392

The Polish Digital Mathematics Library

On critical and cocritical radius edge-invariant graphs

Ondrej Vacek

Access to full text
Full (PDF)

p. 393-418

The Polish Digital Mathematics Library

On distinguishing and distinguishing chromatic numbers of hypercubes

Werner Klöckl

Access to full text
Full (PDF)

p. 419-429

The Polish Digital Mathematics Library

Product rosy labeling of graphs

Dalibor Fronček

Access to full text
Full (PDF)

p. 431-439

The Polish Digital Mathematics Library

On long cycles through four prescribed vertices of a polyhedral graph

Jochen Harant ; Stanislav Jendrol' ; Hansjoachim Walther

Access to full text
Full (PDF)

p. 441-451

The Polish Digital Mathematics Library

The bondage number of graphs: good and bad vertices

Vladimir Samodivkin

Access to full text
Full (PDF)

p. 453-462

The Polish Digital Mathematics Library

Embedding complete ternary trees into hypercubes

S.A. Choudum ; S. Lavanya

Access to full text
Full (PDF)

p. 463-476

The Polish Digital Mathematics Library

The signed matchings in graphs

Changping Wang

Access to full text
Full (PDF)

p. 477-486

The Polish Digital Mathematics Library

Order unicyclic graphs according to spectral radius of unoriented laplacian matrix

Yi-Zheng Fan ; Song Wu

Access to full text
Full (PDF)

p. 487-499

The Polish Digital Mathematics Library

On the tree graph of a connected graph

Ana Paulina Figueroa ; Eduardo Rivera-Campo

Access to full text
Full (PDF)

p. 501-510

The Polish Digital Mathematics Library

The sizes of components in random circle graphs

Ramin Imany-Nabiyyi

Access to full text
Full (PDF)

p. 511-533

The Polish Digital Mathematics Library

Independent cycles and paths in bipartite balanced graphs

Beata Orchel ; A. Paweł Wojda

Access to full text
Full (PDF)

p. 535-549

The Polish Digital Mathematics Library

Path and cycle factors of cubic bipartite graphs

M. Kano ; Changwoo Lee ; Kazuhiro Suzuki

Access to full text
Full (PDF)

p. 551-556

The Polish Digital Mathematics Library

Gurusamy Rengasamy Vijayakumar

Access to full text
Full (PDF)

p. 557-561

The Polish Digital Mathematics Library

Triangle-free planar graphs with minimum degree 3 have radius at least 3

Seog-Jin Kim ; Douglas B. West

Access to full text
Full (PDF)

p. 563-566

The Polish Digital Mathematics Library