Sommaire du Fascicule no. 1

On Monochromatic Subgraphs of Edge-Colored Complete Graphs
p. 5
Hypergraphs with Pendant Paths are not Chromatically Unique
p. 23
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
p. 31
A Note on the Permanental Roots of Bipartite Graphs
p. 49
Lattice-Like Total Perfect Codes
p. 57
Supermagic Graphs Having a Saturated Vertex
p. 75
Packing the Hypercube
p. 85
The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number
p. 95
On The Determinant of q-Distance Matrix of a Graph
p. 103
On the Decompositions of Complete Graphs into Cycles and Stars on the Same Number of Edges
p. 113
On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs
p. 127
Tree-Like Partial Hamming Graphs
p. 137
Maximum Hypergraphs without Regular Subgraphs
p. 151
On the Complexity of the 3-Kernel Problem in Some Classes of Digraphs
p. 167
Smallest Regular Graphs of Given Degree and Diameter
p. 187
Star-Cycle Factors of Graphs
p. 193
Packing Trees Into n-Chromatic Graphs
p. 199

Sommaire du Fascicule no. 2

Motion planning in cartesian product graphs
p. 207
The ramsey number for theta graph versus a clique of order three and four
p. 223
The depression of a graph and k-kernels
p. 233
A ramsey-type theorem for multiple disjoint copies of induced subgraphs
p. 249
The irregularity of graphs under graph operations
p. 263
On the uniqueness of d-vertex magic constant
p. 279
Heavy subgraph pairs for traceability of block-chains
p. 287
Rank numbers for bent ladders
p. 309
A decomposition of gallai multigraphs
p. 331
The niche graphs of interval orders
p. 353
Families of triples with high minimum degree are hamiltonian
p. 361
On degree sets and the minimum orders in bipartite graphs
p. 383
On eulerian irregularity in graphs
p. 391
A note on pm-compact bipartite graphs
p. 409
Maximal buttonings of trees
p. 415
A note on face coloring entire weightings of plane graphs
p. 421

Sommaire du Fascicule no. 3

On the Existence of (k,l)-Kernels in Infinite Digraphs: A Survey
p. 431
Induced Acyclic Tournaments in Random Digraphs: Sharp Concentration, Thresholds and Algorithms
p. 467
Two Graphs with a Common Edge
p. 497
A Characterization of 2-Tree Probe Interval Graphs
p. 509
A Reduction of the Graph Reconstruction Conjecture
p. 529
5-Stars of Low Weight in Normal Plane Maps with Minimum Degree 5
p. 539
Chromatic Polynomials of Mixed Hypercycles
p. 547
Characterization of Cubic Graphs G with ir t (G) = Ir t (G) = 2
p. 559
Tetravalent Arc-Transitive Graphs of Order 3p 2
p. 567
On the Independence Number of Edge Chromatic Critical Graphs
p. 577
Degree Sequences of Monocore Graphs
p. 585
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs
p. 593
Downhill Domination in Graphs
p. 603
On Twin Edge Colorings of Graphs
p. 613
The Domination Number of K 3 n
p. 629
A Different Short Proof of Brooks’ Theorem
p. 633
On the Erdős-Gyárfás Conjecture in Claw-Free Graphs
p. 635
A Note on a Broken-Cycle Theorem for Hypergraphs
p. 641

Sommaire du Fascicule no. 4

Some Remarks On The Structure Of Strong K-Transitive Digraphs
p. 651
Pairs Of Edges As Chords And As Cut-Edges
p. 673
The Connectivity Of Domination Dot-Critical Graphs With No Critical Vertices
p. 683
On Super Edge-Antimagic Total Labeling Of Subdivided Stars
p. 691
Color Energy Of A Unitary Cayley Graph
p. 707
Strong Chromatic Index Of Planar Graphs With Large Girth
p. 723
Extremal Unicyclic Graphs With Minimal Distance Spectral Radius
p. 735
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
p. 751
The 1 , 2 , 3-Conjecture And 1 , 2-Conjecture For Sparse Graphs
p. 769
An Implicit Weighted Degree Condition For Heavy Cycles
p. 801
The Well-Covered Dimension Of Products Of Graphs
p. 811
Characterization Of Super-Radial Graphs
p. 829
A Note On Vertex Colorings Of Plane Graphs
p. 849
Note: The Smallest Nonevasive Graph Property
p. 857