Geodesic

Sommaire du Fascicule no. 1

Competition hypergraphs of digraphs with certain properties I. Strong connectedness
p. 5-21
Competition hypergraphs of digraphs with certain properties II. Hamiltonicity
p. 23-34
Recognizable colorings of graphs
p. 35-57
Trees with equal total domination and total restrained domination numbers
p. 59-66
A classification for maximal nonhamiltonian Burkard-Hammer graphs
p. 67-89
An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles
p. 91-96
Partitions of a graph into cycles containing a specified linear forest
p. 97-107
Weakly connected domination subdivision numbers
p. 109-119
Paths of low weight in planar graphs
p. 121-135
(H,k) stable graphs with minimum size
p. 137-149
Maximal k-independent sets in graphs
p. 151-163
Radio k-labelings for Cartesian products of graphs
p. 165-178
A cancellation property for the direct product of graphs
p. 179-184

Sommaire du Fascicule no. 2

The chromatic equivalence class of graph $\overline{B_{n-6,1,2}}$
p. 189-218
The Wiener number of Kneser graphs
p. 219-228
Minimal cycle bases of the lexicographic product of graphs
p. 229-247
On the structure of path-like trees
p. 249-265
Secure domination and secure total domination in graphs
p. 267-284
Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments
p. 285-306
Clique irreducibility of some iterative classes of graphs
p. 307-321
On acyclic colorings of direct products
p. 323-333
A note on domination parameters in random graphs
p. 335-343
An upper bound on the Laplacian spectral radius of the signed graphs
p. 345-359
A remark on the (2,2)-domination number
p. 361-366
Ordered and linked chordal graphs
p. 367-373
Solution to the problem of Kubesa
p. 375-378

Sommaire du Fascicule no. 3

On locating and differentiating-total domination in trees
p. 383-392
On critical and cocritical radius edge-invariant graphs
p. 393-418
On distinguishing and distinguishing chromatic numbers of hypercubes
p. 419-429
Product rosy labeling of graphs
p. 431-439
On long cycles through four prescribed vertices of a polyhedral graph
p. 441-451
The bondage number of graphs: good and bad vertices
p. 453-462
Embedding complete ternary trees into hypercubes
p. 463-476
The signed matchings in graphs
p. 477-486
Order unicyclic graphs according to spectral radius of unoriented laplacian matrix
p. 487-499
On the tree graph of a connected graph
p. 501-510
The sizes of components in random circle graphs
p. 511-533
Independent cycles and paths in bipartite balanced graphs
p. 535-549
Path and cycle factors of cubic bipartite graphs
p. 551-556
A result related to the largest eigenvalue of a tree
p. 557-561
Triangle-free planar graphs with minimum degree 3 have radius at least 3
p. 563-566