Geodesic

Volume 39 (2019) no. 1

Sommaire

The Super-Connectivity of Kneser Graphs
p. 5-11
A Note on Roman Domination of Digraphs
p. 13-21
The Bipartite-Splittance of a Bipartite Graph
p. 23-29
Bounding the Locating-Total Domination Number of a Tree in Terms of Its Annihilation Number
p. 31-40
Some Progress on the Double Roman Domination in Graphs
p. 41-53
An Efficient Polynomial Time Approximation Scheme for the Vertex Cover P3 Problem on Planar Graphs
p. 55-65
Bounds on the Signed Roman k-Domination Number of a Digraph
p. 67-79
Facial Incidence Colorings of Embedded Multigraphs
p. 81-93
Arc Fault Tolerance of Cartesian Product of Regular Digraphs on Super-Restricted Arc-Connectivity
p. 95-116
Hamilton Cycles in Double Generalized Petersen Graphs
p. 117-123
New Formulae for the Decycling Number of Graphs
p. 125-141
L(2, 1)-Labeling of Circulant Graphs
p. 143-155
Gaps in the Saturation Spectrum of Trees
p. 157-170
On the Hamiltonian Number of a Plane Graph
p. 171-181
Independence Number, Connectivity and All Fractional (a, b, k)-Critical Graphs
p. 183-190
Oriented Incidence Colourings of Digraphs
p. 191-210
Oriented Chromatic Number of Cartesian Products and Strong Products of Paths
p. 211-223
Almost Injective Colorings
p. 225-239
Decomposition of the Product of Cycles Based on Degree Partition
p. 241-256
Pair L(2, 1)-Labelings of Infinite Graphs
p. 257-269
Antipodal Edge-Colorings of Hypercubes
p. 271-284
Anti-Ramsey Number of Hanoi Graphs
p. 285-296