Geodesic

Sommaire du Fascicule no. 1

Packing Parameters in Graphs
p. 5-16
Harary Index of Product Graphs
p. 17-33
Products of Geodesic Graphs and the Geodetic Number of Products
p. 35-42
α-Labelings of a Class of Generalized Petersen Graphs
p. 43-53
2-Tone Colorings in Graph Products
p. 55-72
On Decomposing Regular Graphs Into Isomorphic Double-Stars
p. 73-79
The 3-Rainbow Index of a Graph
p. 81-94
Graphic Splitting of Cographic Matroids
p. 95-104
Graphs with 3-Rainbow Index n − 1 and n − 2
p. 105-120
Maximum Cycle Packing in Eulerian Graphs Using Local Traces
p. 121-132
Remarks on Dynamic Monopolies with Given Average Thresholds
p. 133-140
An Oriented Version of the 1-2-3 Conjecture
p. 141-156
Optimal Backbone Coloring of Split Graphs with Matching Backbones
p. 157-169
Constrained Colouring and σ-Hypergraphs
p. 171-189
On a Spanning $k$-Tree in which Specified Vertices Have Degree Less Than $k$
p. 191-196
Fractional Aspects of the Erdős-Faber-Lovász Conjecture
p. 197-202

Sommaire du Fascicule no. 2

On Uniquely Hamiltonian Claw-Free and Triangle-Free Graphs
p. 207-214
On •-Line Signed Graphs L•(S)
p. 215-227
(K − 1)-Kernels In Strong K-Transitive Digraphs
p. 229-235
A Note on the Total Detection Numbers of Cycles
p. 237-247
The Least Eigenvalue of Graphs whose Complements Are Unicyclic
p. 249-260
The k-Rainbow Bondage Number of a Digraph
p. 261-270
On k-Path Pancyclic Graphs
p. 271-281
Domination, Eternal Domination, and Clique Covering
p. 283-300
Characterizing which Powers of Hypercubes and Folded Hypercubes Are Divisor Graphs
p. 301-311
Total Domination Multisubdivision Number of a Graph
p. 315-327
Improved Sufficient Conditions for Hamiltonian Properties
p. 329-334
Bipartition Polynomials, the Ising Model, and Domination in Graphs
p. 335-353
Eigenvalue Conditions for Induced Subgraphs
p. 355-363
Extending the MAX Algorithm for Maximum Independent Set
p. 365-386
Graphs with 4-Rainbow Index 3 and n − 1
p. 387-398

Sommaire du Fascicule no. 3

On Minimal Geodetic Domination in Graphs
p. 403-418
A Note on Longest Paths in Circular Arc Graphs
p. 419-426
Completely Independent Spanning Trees in (Partial) k-Trees
p. 427-437
The Median Problem on k-Partite Graphs
p. 439-446
Optimal Locating-Total Dominating Sets in Strips of Height 3
p. 447-462
Generalized Fractional Total Colorings of Graphs
p. 463-473
Strong ƒ-Star Factors of Graphs
p. 475-482
Reconstructing Surface Triangulations by Their Intersection Matrices
p. 483-491
Decomposability of Abstract and Path-Induced Convexities in Hypergraphs
p. 493-515
Generalized Fractional and Circular Total Colorings of Graphs
p. 517-532
Pancyclicity when each Cycle Must Pass Exactly k Hamilton Cycle Chords
p. 533-539
Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs
p. 541-555
The Saturation Number for the Length of Degree Monotone Paths
p. 557-569
Worm Colorings
p. 571-584
A Note on Total Graphs
p. 585-587
Characterization of Line-Consistent Signed Graphs
p. 589-594
On the Hypercompetition Numbers of Hypergraphs with Maximum Degree at Most Two
p. 595-598

Sommaire du Fascicule no. 4

Asteroidal Quadruples in non Rooted Path Graphs
p. 603-614
On Unique Minimum Dominating Sets in Some Cartesian Product Graphs
p. 615-628
Decomposition of Complete Multigraphs Into Stars and Cycles
p. 629-639
Upper Bounds on the Signed Total (k, k)-Domatic Number of Graphs
p. 641-650
On the Signed (Total) k-Independence Number in Graphs
p. 651-662
On Super Edge-Antimagicness of Subdivided Stars
p. 663-673
Maximum Independent Sets in Direct Products of Cycles or Trees with Arbitrary Graphs
p. 675-688
Critical Graphs for R(Pn, Pm) and the Star-Critical Ramsey Number for Paths
p. 689-701
Some Toughness Results in Independent Domination Critical Graphs
p. 703-713
Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having $k$ Edges
p. 715-731
Rainbow Tetrahedra in Cayley Graphs
p. 733-754
On Super $(a, d)$-$H$-Antimagic Total Covering of Star Related Graphs
p. 755-764
A New Characterization of Unichord-Free Graphs
p. 765-771
Unified Spectral Bounds on the Chromatic Number
p. 773-780
Domination Game Critical Graphs
p. 781-796
Fault Tolerant Detectors for Distinguishing Sets in Graphs
p. 797-818