Sommaire du Fascicule no. 1

Dense Arbitrarily Partitionable Graphs
p. 5
Split Euler Tours In 4-Regular Planar Graphs
p. 23
Note On The Game Colouring Number Of Powers Of Graphs
p. 31
Products Of Digraphs And Their Competition Graphs
p. 43
M 2 -Edge Colorings Of Cacti And Graph Joins
p. 59
Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree
p. 71
Unique-Maximum Coloring Of Plane Graphs
p. 95
γ-Cycles In Arc-Colored Digraphs
p. 103
Maximum Edge-Colorings Of Graphs
p. 117
On Spectra Of Variants Of The Corona Of Two Graphs And Some New Equienergetic Graphs
p. 127
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
p. 141
Bounds On The Disjunctive Total Domination Number Of A Tree
p. 153
A Fan-Type Heavy Pair Of Subgraphs For Pancyclicity Of 2-Connected Graphs
p. 173
Weak Total Resolvability In Graphs
p. 185
Supermagic Generalized Double Graphs 1
p. 211
Light Graphs In Planar Graphs Of Large Girth
p. 227

Sommaire du Fascicule no. 2

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

Sommaire du Fascicule no. 3

Extremal Matching Energy of Complements of Trees
p. 505
Cycle Double Covers of Infinite Planar Graphs
p. 523
Looseness and Independence Number of Triangulations on Closed Surfaces
p. 545
A New Proof that 4-Connected Planar Graphs are Hamiltonian-Connected
p. 555
On Longest Cycles in Essentially 4-Connected Planar Graphs
p. 565
The Smallest Non-Autograph
p. 577
On the Weight of Minor Faces in Triangle-Free 3-Polytopes
p. 603
The Ryjáček Closure and a Forbidden Subgraph
p. 621
Various Bounds for Liar’s Domination Number
p. 629
Triangle Decompositions of Planar Graphs
p. 643
Some Variations of Perfect Graphs
p. 661
The Vertex-Rainbow Index of A Graph
p. 669
The Turán Number of the Graph 2P5
p. 683
Nordhaus-Gaddum-Type Results for Resistance Distance-Based Graph Invariants
p. 695
Sum List Edge Colorings of Graphs
p. 709
Splitting Cubic Circle Graphs
p. 723
On Path-Pairability in the Cartesian Product of Graphs
p. 743
K3-Worm Colorings of Graphs: Lower Chromatic Number and Gaps in the Chromatic Spectrum
p. 759
Spanning Trees whose Stems have a Bounded Number of Branch Vertices
p. 773

Sommaire du Fascicule no. 4

Perfect Set of Euler Tours of Kp,p,p
p. 783
Integral Cayley Sum Graphs and Groups
p. 797
On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes
p. 805
Niche Hypergraphs
p. 819
Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs
p. 833
Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges
p. 845
Edge-Transitive Lexicographic and Cartesian Products
p. 857
The Gutman Index and the Edge-Wiener Index of Graphs with Given Vertex-Connectivity
p. 867
On the Complexity of Reinforcement in Graphs
p. 877
An Extension of Kotzig’s Theorem
p. 889
The Dynamics of the Forest Graph Operator
p. 899
Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
p. 915
Graphs with Large Generalized (Edge-)Connectivity
p. 931
Bounds for the b-Chromatic Number of Subgraphs and Edge-Deleted Subgraphs
p. 959
Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs
p. 977
Vertex Colorings without Rainbow Subgraphs
p. 989
Radio Graceful Hamming Graphs
p. 1007
A Note on Path Domination
p. 1021
Edge-Transitivity of Cayley Graphs Generated by Transpositions
p. 1035
A Note on Non-Dominating Set Partitions in Graphs
p. 1043
Closed Formulae for the Strong Metric Dimension of Lexicographi
p. 1051