Sommaire

Radio k-colorings of paths

Gary Chartrand ; Ladislav Nebeský ; Ping Zhang

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

The Polish Digital Mathematics Library
Hamilton cycles in split graphs with large minimum degree

Ngo Dac Tan ; Le Xuan Hung

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

The Polish Digital Mathematics Library
Characterizations of planar plick graphs

V.R. Kulli ; B. Basavanagoud

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

The Polish Digital Mathematics Library
Forbidden triples implying Hamiltonicity: for all graphs

Ralph J. Faudree ; Ronald J. Gould ; Michael S. Jacobson

Access to full text
Full (PDF)
p. 47-54

The Polish Digital Mathematics Library
On traceability and 2-factors in claw-free graphs

Dalibor Fronček ; Zdeněk Ryjáček ; Zdzisław Skupień

Access to full text
Full (PDF)
p. 55-71

The Polish Digital Mathematics Library
On the heterochromatic number of circulant digraphs

Hortensia Galeana-Sánchez ; Víctor Neumann-Lara

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

The Polish Digital Mathematics Library
A note on strongly multiplicative graphs

Chandrashekar Adiga ; H.N. Ramaswamy ; D.D. Somashekara

Access to full text
Full (PDF)
p. 81-83

The Polish Digital Mathematics Library
Light classes of generalized stars in polyhedral maps on surfaces

Stanislav Jendrol' ; Heinz-Jürgen Voss

Access to full text
Full (PDF)
p. 85-107

The Polish Digital Mathematics Library
Some applications of pq-groups in graph theory

Geoffrey Exoo

Access to full text
Full (PDF)
p. 109-114

The Polish Digital Mathematics Library
A note on minimally 3-connected graphs

Víctor Neumann-Lara ; Eduardo Rivera-Campo ; Jorge Urrutia

Access to full text
Full (PDF)
p. 115-123

The Polish Digital Mathematics Library
A note on total colorings of planar graphs without 4-cycles

Ping Wang ; Jian-Liang Wu

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

The Polish Digital Mathematics Library
A simple linear algorithm for the connected domination problem in circular-arc graphs

Ruo-Wei Hung ; Maw-Shang Chang

Access to full text
Full (PDF)
p. 137-145

The Polish Digital Mathematics Library
Generalised irredundance in graphs: Nordhaus-Gaddum bounds

Ernest J. Cockayne ; Stephen Finbow

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

The Polish Digital Mathematics Library
Lower bound on the domination number of a tree

Magdalena Lemańska

Access to full text
Full (PDF)
p. 165-169

The Polish Digital Mathematics Library
Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel

Hortensia Galeana-Sánchez

Access to full text
Full (PDF)
p. 171-182

The Polish Digital Mathematics Library
New lower bounds on the weighted chromatic number of a graph

Massimiliano Caramia ; Jirí Fiala

Access to full text
Full (PDF)
p. 183-195

The Polish Digital Mathematics Library
Pₘ-saturated bipartite graphs with minimum size

Aneta Dudek ; A. Paweł Wojda

Access to full text
Full (PDF)
p. 197-211

The Polish Digital Mathematics Library
Bounds for index of a modified graph

Bo Zhou

Access to full text
Full (PDF)
p. 213-221

The Polish Digital Mathematics Library
Minimal regular graphs with given girths and crossing numbers

G.L. Chia ; C.S. Gan

Access to full text
Full (PDF)
p. 223-237

The Polish Digital Mathematics Library
Hereditary domination and independence parameters

Wayne Goddard ; Teresa Haynes ; Debra Knisley

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

The Polish Digital Mathematics Library
Vertex-disjoint copies of K¯₄

Ken-ichi Kawarabayashi

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

The Polish Digital Mathematics Library
Offensive alliances in graphs

Odile Favaron ; Gerd Fricke ; Wayne Goddard ; Sandra M. Hedetniemi ; Stephen T. Hedetniemi ; Petter Kristiansen ; Renu C. Laskar ; R. Duane Skaggs

Access to full text
Full (PDF)
p. 263-275

The Polish Digital Mathematics Library
Cycle-pancyclism in bipartite tournaments I

Hortensia Galeana-Sánchez

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

The Polish Digital Mathematics Library
Graphs with small additive stretch number

Dieter Rautenbach

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

The Polish Digital Mathematics Library
On the domination number of prisms of graphs

Alewyn P. Burger ; Christina M. Mynhardt ; William D. Weakley

Access to full text
Full (PDF)
p. 303-318

The Polish Digital Mathematics Library
Unique factorisation of additive induced-hereditary properties

Alastair Farrugia ; R. Bruce Richter

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

The Polish Digital Mathematics Library
Cyclic decompositions of complete graphs into spanning trees

Dalibor Froncek

Access to full text
Full (PDF)
p. 345-353

The Polish Digital Mathematics Library
Linear forests and ordered cycles

Guantao Chen ; Ralph J. Faudree ; Ronald J. Gould ; Michael S. Jacobson ; Linda Lesniak ; Florian Pfender

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

The Polish Digital Mathematics Library
Analogues of cliques for oriented coloring

William F. Klostermeyer ; Gary MacGillivray

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

The Polish Digital Mathematics Library
On dominating the Cartesian product of a graph and K₂

Bert L. Hartnell ; Douglas F. Rall

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

The Polish Digital Mathematics Library
On the structure of plane graphs of minimum face size 5

Tomás Madaras

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

The Polish Digital Mathematics Library
On 3-simplicial vertices in planar graphs

Endre Boros ; Robert E. Jamison ; Renu Laskar ; Henry Martyn Mulder

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

The Polish Digital Mathematics Library
Some remarks on α-domination

Franz Dahme ; Dieter Rautenbach ; Lutz Volkmann

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

The Polish Digital Mathematics Library
Even [a,b]-factors in graphs

Mekkia Kouider ; Preben Dahl Vestergaard

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

The Polish Digital Mathematics Library
Packing of three copies of a digraph into the transitive tournament

Monika Pilśniak

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

The Polish Digital Mathematics Library
Total domination subdivision numbers of graphs

Teresa W. Haynes ; Michael A. Henning ; Lora S. Hopkins

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

The Polish Digital Mathematics Library
Short paths in 3-uniform quasi-random hypergraphs

Joanna Polcyn

Access to full text
Full (PDF)
p. 469-484

The Polish Digital Mathematics Library
Dominant-matching graphs

Igor' E. Zverovich ; Olga I. Zverovich

Access to full text
Full (PDF)
p. 485-490

The Polish Digital Mathematics Library
Centers of n-fold tensor products of graphs

Sarah Bendall ; Richard Hammack

Access to full text
Full (PDF)
p. 491-501

The Polish Digital Mathematics Library
Graphs without induced P₅ and C₅

Gabor Bacsó ; Zsolt Tuza

Access to full text
Full (PDF)
p. 503-507

The Polish Digital Mathematics Library
Difference labelling of digraphs

Martin Sonntag

Access to full text
Full (PDF)
p. 509-527

The Polish Digital Mathematics Library
Cycle-pancyclism in bipartite tournaments II

Hortensia Galeana-Sánchez

Access to full text
Full (PDF)
p. 529-538

The Polish Digital Mathematics Library
A Gallai-type equality for the total domination number of a graph

Sanming Zhou

Access to full text
Full (PDF)
p. 539-543

The Polish Digital Mathematics Library
A clone-theoretic formulation of the Erdos-Faber-Lovász conjecture

Lucien Haddad ; Claude Tardif

Access to full text
Full (PDF)
p. 545-549

The Polish Digital Mathematics Library