Geodesic

Sommaire du Fascicule no. 1

All Tight Descriptions of 3-Stars in 3-Polytopes with Girth 5
p. 5-12
A Finite Characterization and Recognition of Intersection Graphs of Hypergraphs with Rank at Most 3 and Multiplicity at Most 2 in the Class of Threshold Graphs
p. 13-28
A Note on Neighbor Expanded Sum Distinguishing Index
p. 29-37
Signed Roman Edge k -Domination in Graphs
p. 39-53
Decomposition of Certain Complete Bipartite Graphs into Prisms
p. 55-62
Eternal Domination: Criticality and Reachability
p. 63-77
On the H -Force Number of Hamiltonian Graphs and Cycle Extendability
p. 79-88
Structural Properties of Recursively Partitionable Graphs with Connectivity 2
p. 89-115
Some Results on 4-Transitive Digraphs
p. 117-129
Almost Self-Complementary 3-Uniform Hypergraphs
p. 131-140
Rainbow Connection Number of Graphs with Diameter 3
p. 141-154
Distinguishing Cartesian Products of Countable Graphs
p. 155-164
The list Distinguishing Number Equals the Distinguishing Number for Interval Graphs
p. 165-174
Criticality of Switching Classes of Reversible 2-Structures Labeled by an Abelian Group
p. 175-209
On q-Power Cycles in Cubic Graphs
p. 211-220
The Dichromatic Number of Infinite Families of Circulant Tournaments
p. 221-238
Union of Distance Magic Graphs
p. 239-249
A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs
p. 251-259
Signed Total Roman Domination in Digraphs
p. 261-272
Computing the Metric Dimension of a Graph from Primary Subgraphs
p. 273-293

Sommaire du Fascicule no. 2

Rainbow Connectivity of Cacti and of Some Infinite Digraphs
p. 301-313
Forbidden Structures for Planar Perfect Consecutively Colourable Graphs
p. 315-336
How Long Can One Bluff in the Domination Game?
p. 337-352
WORM Colorings of Planar Graphs
p. 353-368
Domination Game: Extremal Families for the 3/5-Conjecture for Forests
p. 369-381
Distance 2-Domination in Prisms of Graphs
p. 383-397
On the Crossing Numbers of Cartesian Products of Wheels and Trees
p. 399-413
On Sequential Heuristic Methods for the Maximum Independent Set Problem
p. 415-426
Interval Incidence Coloring of Subcubic Graphs
p. 427-441
One More Turán Number and Ramsey Number for the Loose 3-Uniform Path of Length Three
p. 443-464
The Chromatic Number of Random Intersection Graphs
p. 465-476
A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs
p. 477-499

Sommaire du Fascicule no. 3

On the Laplacian Coefficients of Tricyclic Graphs with Prescribed Matching Number
p. 505-522
C7-Decompositions of the Tensor Product of Complete Graphs
p. 523-535
A Sufficient Condition for Graphs to Be Super k-Restricted Edge Connected
p. 537-545
On Generalized Sierpiński Graphs
p. 547-560
The Thickness of Amalgamations and Cartesian Product of Graphs
p. 561-572
Regularity and Planarity of Token Graphs
p. 573-586
Characterizing Atoms that Result from Decomposition by Clique Separators
p. 587-594
Construction of Cospectral Integral Regular Graphs
p. 595-609
Characterization Results for the L(2, 1, 1)-Labeling Problem on Trees
p. 611-622
On the Maximum and Minimum Sizes of a Graph with Given k-Connectivity
p. 623-632
One-Three Join: A Graph Operation and Its Consequences
p. 633-647
Forbidden Pairs and (k, m)-Pancyclicity
p. 649-663
Packing Coloring of Some Undirected and Oriented Coronae Graphs
p. 665-690
Heavy Subgraphs, Stability and Hamiltonicity
p. 691-710
Kaleidoscopic Colorings of Graphs
p. 711-727
On the Spectral Characterizations of Graphs
p. 729-744
A Note on the Locating-Total Domination in Graphs
p. 745-754
Ramsey Properties of Random Graphs and Folkman Numbers
p. 755-776
Chromatic Properties of the Pancake Graphs
p. 777-787
Asymptotic Sharpness of Bounds on Hypertrees
p. 789-795
A Degree Condition Implying Ore-Type Condition for Even [2, b]-Factors in Graphs
p. 797-809
Saturation Spectrum of Paths and Stars
p. 811-822
The Degree-Diameter Problem for Outerplanar Graphs
p. 823-834
On Double-Star Decomposition of Graphs
p. 835-840

Sommaire du Fascicule no. 4

Strong Edge-Coloring Of Planar Graphs
p. 845-857
On The Roman Domination Stable Graphs
p. 859-871
Prime Factorization And Domination In The Hierarchical Product Of Graphs
p. 873-890
Constant 2-Labellings And An Application To (R, A, B)-Covering Codes
p. 891-918
The Total Acquisition Number Of The Randomly Weighted Path
p. 919-934
Per-Spectral Characterizations Of Some Bipartite Graphs
p. 935-951
Relating 2-Rainbow Domination To Roman Domination
p. 953-961
Every 8-Traceable Oriented Graph Is Traceable
p. 963-973
A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs
p. 975-988
Twin Minus Total Domination Numbers In Directed Graphs
p. 989-1004
Proper Connection Of Direct Products
p. 1005-1013
Labeled Embedding Of (n, n-2)-Graphs In Their Complements
p. 1015-1025
The Signed Total Roman k-Domatic Number Of A Graph
p. 1027-1038
Signed Total Roman Edge Domination In Graphs
p. 1039-1053
The Existence Of P≥3-Factor Covered Graphs
p. 1055-1065
On H-Irregularity Strength Of Graphs
p. 1067-1078
Equitable Colorings Of Corona Multiproducts Of Graphs
p. 1079-1094