Geodesic

Tome 39 (2019) no. 2

Sommaire

On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords
p. 301-312
On the b -Domatic Number of Graphs
p. 313-324
Global Dominator Coloring of Graphs
p. 325-339
Error-Correcting Codes from k -Resolving Sets
p. 341-355
Edge-Connectivity and Edges of Even Factors of Graphs
p. 357-364
Strongly Unichord-Free Graphs
p. 365-374
On Graphs Representable by Pattern-Avoiding Words
p. 375-389
On 3-Colorings of Direct Products of Graphs
p. 391-413
Arankings of Trees
p. 415-437
On Some Characterizations of Antipodal Partial Cubes
p. 439-453
On The Co-Roman Domination in Graphs
p. 455-472
More Results on The Smallest One-Realization of A Given Set II
p. 473-487
Fair Domination Number in Cactus Graphs
p. 489-503
The Product Connectivity Banhatti Index of a Graph
p. 505-517
On The Total Roman Domination in Trees
p. 519-532
Orientable $ \mathbb{Z}_N $-Distance Magic Graphs
p. 533-546
The Crossing Number of The Hexagonal Graph H3,n
p. 547-554
The Second Neighbourhood for Bipartite Tournaments
p. 555-565
Sufficient Conditions for Maximally Edge-Connected and Super-Edge-Connected Graphs Depending on The Clique Number
p. 567-573
1-Restricted Optimal Rubbling on Graphs
p. 575-588
2-Distance Colorings of Integer Distance Graphs
p. 589-603
Minimum Edge Cuts in Diameter 2 Graphs
p. 605-608