Geodesic

Sommaire du Fascicule no. 1

A Survey on the Cyclic Coloring and its Relaxations
p. 5-38
Domination Number, Independent Domination Number and 2-Independence Number in Trees
p. 39-49
Linear List Coloring of Some Sparse Graphs
p. 51-64
Minimal Graphs with Respect to Geometric Distance Realizability
p. 65-73
On the n-Partite Tournaments with Exactly n − m + 1 Cycles of Length m
p. 75-82
Large Contractible Subgraphs of a 3-Connected Graph
p. 83-101
Generalized Hypergraph Coloring
p. 103-121
Dominating Vertex Covers: The Vertex-Edge Domination Problem
p. 123-132
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs
p. 133-152
Intersection Dimension and Graph Invariants
p. 153-166
On Implicit Heavy Subgraphs and Hamiltonicity of 2-Connected Graphs
p. 167-181
The Crossing Number of Cartesian Product of 5-Wheel with any Tree
p. 183-197
List Edge Coloring of Planar Graphs without 6-Cycles with Two Chords
p. 199-211
Independent Transversal Total Domination versus Total Domination in Trees
p. 213-224
On Grundy Total Domination Number in Product Graphs
p. 225-247
Decomposition of the Tensor Product of Complete Graphs into Cycles of Lengths 3 and 6
p. 249-266
A Constructive Characterization of Vertex Cover Roman Trees
p. 267-283
Dualizing Distance-Hereditary Graphs
p. 285-296
Arc-Disjoint Hamiltonian Paths in Strong Round Decomposable Local Tournaments
p. 297-310
Coverings of Cubic Graphs and 3-Edge Colorability
p. 311-334
Graph Exponentiation and Neighborhood Reconstruction
p. 335-339

Sommaire du Fascicule no. 2

Total 2-Rainbow Domination Numbers of Trees
p. 345-364
Changing and Unchanging of the Domination Number of a Graph: Path Addition Numbers
p. 365-379
Star-Critical Ramsey Numbers for Cycles versus K4
p. 381-390
H-Kernels in Unions of H-Colored Quasi-Transitive Digraphs
p. 391-408
The Minimum Size of a Graph with Given Tree Connectivity
p. 409-425
On the Star Chromatic Index of Generalized Petersen Graphs
p. 427-439
T-Colorings, Divisibility and the Circular Chromatic Number
p. 441-450
Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
p. 451-468
On Proper (Strong) Rainbow Connection of Graphs
p. 469-479
Internally 4-Connected Graphs with No {Cube, V8}-Minor
p. 481-501
Critical and Flow-Critical Snarks Coincide
p. 503-511
The Vertex-Rainbow Connection Number of Some Graph Operations
p. 513-530
On (p, 1)-Total Labelling of Some 1-Planar Graphs
p. 531-558
Removable Edges on a Hamilton Cycle or Outside a Cycle in a 4-Connected Graph
p. 559-587
Asymptotic Behavior of the Edge Metric Dimension of the Random Graph
p. 589-599
Triameter of Graphs
p. 601-616
Conflict-Free Vertex Connection Number at Most 3 and Size of Graphs
p. 617-632
Restrained Domination in Self-Complementary Graphs
p. 633-645
Fair Total Domination Number in Cactus Graphs
p. 647-664
Block Graphs with Large Paired Domination Multisubdivision Number
p. 665-684
Hamiltonian Cycle Problem in Strong k-Quasi-Transitive Digraphs with Large Diameter
p. 685-690

Sommaire du Fascicule no. 3

Graph Operations and Neighborhood Polynomials
p. 697-711
Achromatic Numbers for Circulant Graphs and Digraphs
p. 713-724
Independence Number and Packing Coloring of Generalized Mycielski Graphs
p. 725-747
A New Framework to Approach Vizing’s Conjecture
p. 749-762
Domination Number of Graphs with Minimum Degree Five
p. 763-777
Alternating-Pancyclism in 2-Edge-Colored Graphs
p. 779-800
Colorings of Plane Graphs Without Long Monochromatic Facial Paths
p. 801-808
Proper Rainbow Connection Number of Graphs
p. 809-826
Minimal Graphs with Disjoint Dominating and Paired-Dominating Sets
p. 827-847

Sommaire du Fascicule no. 4

Sufficient Conditions for a Digraph to Admit A (1, ≤ ℓ)-Identifying Code
p. 853-872
On Semisymmetric Cubic Graphs of Order 20p2, p Prime
p. 873-891
Outpaths of Arcs in Regular 3-Partite Tournaments
p. 893-904
The Lagrangian Density of {123, 234, 456} and the Turán Number of its Extension
p. 905-921
Capture-Time Extremal Cop-Win Graphs
p. 923-948
On Edge H-Irregularity Strengths of Some Graphs
p. 949-961
The Spectrum Problem for the Connected Cubic Graphs of Order 10
p. 963-980
Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
p. 981-999
Coloring of the dth Power of the Face-Centered Cubic Grid
p. 1001-1020
ℤ2 × ℤ2 -Cordial Cycle-Free Hypergraphs
p. 1021-1040
Supermagic Graphs with Many Different Degrees
p. 1041-1050
Distribution of Contractible Edges and the Structure of Noncontractible Edges having Endvertices with Large Degree in a 4-Connected Graph
p. 1051-1066
Hereditary Equality of Domination and Exponential Domination in Subcubic Graphs
p. 1067-1075
On the Isometric Path Partition Problem
p. 1077-1089
A Note on the Equitable Choosability of Complete Bipartite Graphs
p. 1091-1101
Non-1-Planarity of Lexicographic Products of Graphs
p. 1103-1114
Spectra of Orders for k-Regular Graphs of Girth g
p. 1115-1125
On Antipodal and Diametrical Partial Cubes
p. 1127-1145
Equitable Total Coloring of Corona of Cubic Graphs
p. 1147-1163
Total Domination in Generalized Prisms and a New Domination Invariant
p. 1165-1178
Algorithmic Aspects of Secure Connected Domination in Graphs
p. 1179-1197
The General Position Problem on Kneser Graphs and on Some Graph Operations
p. 1199-1213
On List Equitable Total Colorings of the Generalized Theta Graph
p. 1215-1233