Sommaire

Hamiltonicity and Generalised Total Colourings of Planar Graphs
p. 243
Bounds on the Number of Edges of Edge-Minimal, Edge-Maximal and L-Hypertrees
p. 259
Solutions of Some L(2, 1)-Coloring Related Open Problems
p. 279
Distance Magic Cartesian Products of Graphs
p. 299
Kernels by Monochromatic Paths and Color-Perfect Digraphs
p. 309
A Maximum Resonant Set of Polyomino Graphs
p. 323
3-Paths in Graphs with Bounded Average Degree
p. 339
Hardness Results for Total Rainbow Connection of Graphs
p. 355
Large Degree Vertices in Longest Cycles of Graphs, I
p. 363
Heavy Subgraph Conditions for Longest Cycles to Be Heavy in Graphs
p. 383
End Simplicial Vertices in Path Graphs
p. 393
A Neighborhood Condition for Fractional ID-[A, B]-Factor-Critical Graphs
p. 409
The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
p. 419
A Characterization of Hypergraphs with Large Domination Number
p. 427
Characterizations of Graphs Having Large Proper Connection Numbers
p. 439
The Steiner Wiener Index of A Graph
p. 455
New Bounds on the Signed Total Domination Number of Graphs
p. 467
The Quest for A Characterization of Hom-Properties of Finite Character
p. 479