bwmeta1.element.issn-2083-5892, Tome 29 (2009)

Sommaire

Strongly pancyclic and dual-pancyclic graphs

Terry A. McKee

Access to full text
Full (PDF)

p. 5-14

The Polish Digital Mathematics Library

Variable neighborhood search for extremal graphs. 17. Further conjectures and results about the index

Mustapha Aouchiche ; Pierre Hansen ; Dragan Stevanović

Access to full text
Full (PDF)

p. 15-37

The Polish Digital Mathematics Library

k-Kernels and some operations in digraphs

Hortensia Galeana-Sanchez ; Laura Pastrana

Access to full text
Full (PDF)

p. 39-49

The Polish Digital Mathematics Library

Convex independence and the structure of clone-free multipartite tournaments

Darren B. Parker ; Randy F. Westhoff ; Marty J. Wolf

Access to full text
Full (PDF)

p. 51-69

The Polish Digital Mathematics Library

Restrained domination in unicyclic graphs

Johannes H. Hattingh ; Ernst J. Joubert ; Marc Loizeaux ; Andrew R. Plummer ; Lucas van der Merwe

Access to full text
Full (PDF)

p. 71-86

The Polish Digital Mathematics Library

Decompositions of quadrangle-free planar graphs

Oleg V. Borodin ; Anna O. Ivanova ; Alexandr V. Kostochka ; Naeem N. Sheikh

Access to full text
Full (PDF)

p. 87-99

The Polish Digital Mathematics Library

Kernels and cycles' subdivisions in arc-colored tournaments

Pietra Delgado-Escalante ; Hortensia Galeana-Sánchez

Access to full text
Full (PDF)

p. 101-117

The Polish Digital Mathematics Library

Equitable coloring of Kneser graphs

Robert Fidytek ; Hanna Furmańczyk ; Paweł Żyliński

Access to full text
Full (PDF)

p. 119-142

The Polish Digital Mathematics Library

Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number

Hajo Broersma ; Bert Marchal ; Daniel Paulusma ; A.N.M. Salman

Access to full text
Full (PDF)

p. 143-162

The Polish Digital Mathematics Library

Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles

Daniel W. Cranston

Access to full text
Full (PDF)

p. 163-178

The Polish Digital Mathematics Library

Quasiperfect domination in triangular lattices

Italo J. Dejter

Access to full text
Full (PDF)

p. 179-198

The Polish Digital Mathematics Library

A note on k-uniform self-complementary hypergraphs of given order

Artur Szymański ; A. Paweł Wojda

Access to full text
Full (PDF)

p. 199-202

The Polish Digital Mathematics Library

Preface

Access to full text
Full (PDF)

p. 207

The Polish Digital Mathematics Library

Multicolor Ramsey numbers for some paths and cycles

Halina Bielak

Access to full text
Full (PDF)

p. 209-218

The Polish Digital Mathematics Library

Acyclic reducible bounds for outerplanar graphs

Mieczysław Borowiecki ; Anna Fiedorowicz ; Mariusz Hałuszczak

Access to full text
Full (PDF)

p. 219-239

The Polish Digital Mathematics Library

On infinite uniquely partitionable graphs and graph properties of finite character

Jozef Bucko ; Peter Mihók

Access to full text
Full (PDF)

p. 241-251

The Polish Digital Mathematics Library

Minimum vertex ranking spanning tree problem for chordal and proper interval graphs

Dariusz Dereniowski

Access to full text
Full (PDF)

p. 253-261

The Polish Digital Mathematics Library

Cardinality of a minimal forbidden graph family for reducible additive hereditary graph properties

Ewa Drgas-Burchardt

Access to full text
Full (PDF)

p. 263-274

The Polish Digital Mathematics Library

On odd and semi-odd linear partitions of cubic graphs

Jean-Luc Fouquet ; Henri Thuillier ; Jean-Marie Vanherpe ; Adam P. Wojda

Access to full text
Full (PDF)

p. 275-292

The Polish Digital Mathematics Library

On normal partitions in cubic graphs

Jean-Luc Fouquet ; Jean-Marie Vanherpe

Access to full text
Full (PDF)

p. 293-312

The Polish Digital Mathematics Library

Directed hypergraphs: a tool for researching digraphs and hypergraphs

Hortensia Galeana-Sánchez ; Martín Manrique

Access to full text
Full (PDF)

p. 313-335

The Polish Digital Mathematics Library

Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs

Hortensia Galeana-Sánchez ; R. Rojas-Monroy ; B. Zavala

Access to full text
Full (PDF)

p. 337-347

The Polish Digital Mathematics Library

Monochromatic paths and monochromatic sets of arcs in bipartite tournaments

Hortensia Galeana-Sánchez ; R. Rojas-Monroy ; B. Zavala

Access to full text
Full (PDF)

p. 349-360

The Polish Digital Mathematics Library

Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs

Krzysztof Giaro ; Marek Kubale

Access to full text
Full (PDF)

p. 361-376

The Polish Digital Mathematics Library

On 𝓕-independence in graphs

Frank Göring ; Jochen Harant ; Dieter Rautenbach ; Ingo Schiermeyer

Access to full text
Full (PDF)

p. 377-383

The Polish Digital Mathematics Library

On local structure of 1-planar graphs of minimum degree 5 and girth 4

Dávid Hudák ; Tomás Madaras

Access to full text
Full (PDF)

p. 385-400

The Polish Digital Mathematics Library

On universal graphs for hom-properties

Peter Mihók ; Jozef Miškuf ; Gabriel Semanišin

Access to full text
Full (PDF)

p. 401-409

The Polish Digital Mathematics Library

On k-intersection edge colourings

Rahul Muthu ; N. Narayanan ; C.R. Subramanian

Access to full text
Full (PDF)

p. 411-418

The Polish Digital Mathematics Library

On transitive orientations of G-ê

Michael Andresen

Access to full text
Full (PDF)

p. 423-467

The Polish Digital Mathematics Library

Independent transversals of longest paths in locally semicomplete and locally transitive digraphs

Hortensia Galeana-Sánchez ; Ricardo Gómez ; Juan José Montellano-Ballesteros

Access to full text
Full (PDF)

p. 469-480

The Polish Digital Mathematics Library

On Lee's conjecture and some results

Lixia Fan ; Zhihe Liang

Access to full text
Full (PDF)

p. 481-498

The Polish Digital Mathematics Library

The list linear arboricity of planar graphs

Xinhui An ; Baoyindureng Wu

Access to full text
Full (PDF)

p. 499-510

The Polish Digital Mathematics Library

Minimum congestion spanning trees of grids and discrete toruses

Alberto Castejón ; Mikhail I. Ostrovskii

Access to full text
Full (PDF)

p. 511-519

The Polish Digital Mathematics Library

Colouring vertices of plane graphs under restrictions given by faces

Július Czap ; Stanislav Jendrol'

Access to full text
Full (PDF)

p. 521-543

The Polish Digital Mathematics Library

The set chromatic number of a graph

Gary Chartrand ; Futaba Okamoto ; Craig W. Rasmussen ; Ping Zhang

Access to full text
Full (PDF)

p. 545-561

The Polish Digital Mathematics Library

Decompositions of nearly complete digraphs into t isomorphic parts

Mariusz Meszka ; Zdzisław Skupień

Access to full text
Full (PDF)

p. 563-572

The Polish Digital Mathematics Library

(H,k) stable bipartite graphs with minimum size

Aneta Dudek ; Małgorzata Zwonek

Access to full text
Full (PDF)

p. 573-581

The Polish Digital Mathematics Library

Potentially H-bigraphic sequences

Michael Ferrara ; Michael Jacobson ; John Schmitt ; Mark Siggers

Access to full text
Full (PDF)

p. 583-596

The Polish Digital Mathematics Library

Bounds on the global offensive k-alliance number in graphs

Mustapha Chellali ; Teresa W. Haynes ; Bert Randerath ; Lutz Volkmann

Access to full text
Full (PDF)

p. 597-613

The Polish Digital Mathematics Library

Relations between the domination parameters and the chromatic index of a graph

Włodzimierz Ulatowski

Access to full text
Full (PDF)

p. 615-627

The Polish Digital Mathematics Library

Forbidden-minor characterization for the class of graphic element splitting matroids

Kiran Dalvi ; Y.M. Borse ; M.M. Shikare

Access to full text
Full (PDF)

p. 629-644

The Polish Digital Mathematics Library

Pairs of forbidden class of subgraphs concerning

K_{1, 3}

and P₆ to have a cycle containing specified vertices

Takeshi Sugiyama ; Masao Tsugaki

Access to full text
Full (PDF)

p. 645-650

The Polish Digital Mathematics Library

Packing of nonuniform hypergraphs - product and sum of sizes conditions

Paweł Naroski

Access to full text
Full (PDF)

p. 651-656

The Polish Digital Mathematics Library