Geodesic

Sommaire du Fascicule no. 1

Paired domination in prisms of graphs
p. 5-23
Notes on the independence number in the Cartesian product of graphs
p. 25-35
Decomposition tree and indecomposable coverings
p. 37-44
Radio numbers for generalized prism graphs
p. 45-62
Cyclically k-partite digraphs and k-kernels
p. 63-78
A magical approach to some labeling conjectures
p. 79-113
The independent domination number of a random graph
p. 129-142
Closure for spanning trees and distant area
p. 143-159
Coloring rectangular blocks in 3-space
p. 161-170
Weak roman domination in graphs
p. 161-170
The forcing steiner number of a graph
p. 171-181
Parity vertex colouring of graphs
p. 183-195
A characterization of locating-total domination edge critical graphs
p. 197-202

Sommaire du Fascicule no. 2

Generalized total colorings of graphs
p. 209-222
Color-bounded hypergraphs, V: host graphs and subdivisions
p. 223-238
On the crossing numbers of G □ Cₙ for graphs G on six vertices
p. 239-252
On Fulkerson conjecture
p. 253-272
Kernels by monochromatic paths and the color-class digraph
p. 273-281
Monochromatic cycles and monochromatic paths in arc-colored digraphs
p. 283-292
k-kernels in generalizations of transitive digraphs
p. 293-312
Graphs with rainbow connection number two
p. 313-320
The crossing numbers of join products of paths with graphs of order four
p. 321-331
On doubly light vertices in plane graphs
p. 333-344
Generalized circular colouring of graphs
p. 345-356
Interval edge colorings of some products of graphs
p. 357-373
Graphs with equal domination and 2-distance domination numbers
p. 375-385
Bounds for the rainbow connection number of graphs
p. 387-395
Distance independence in graphs
p. 397-409

Sommaire du Fascicule no. 3

Signed domination and signed domatic numbers of digraphs
p. 415-427
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
p. 429-439
Defective choosability of graphs in surfaces
p. 441-459
The connected forcing connected vertex detour number of a graph
p. 461-473
Bounding neighbor-connectivity of Abelian Cayley graphs
p. 475-491
The hull number of strong product graphs
p. 493-507
An inductive proof of Whitney's Broken Circuit Theorem
p. 509-515
γ-graphs of graphs
p. 517-531
Closed k-stop distance in graphs
p. 533-545
Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle
p. 547-557
Unique factorization theorem for object-systems
p. 559-575
Simplicial and nonsimplicial complete subgraphs
p. 577-586
On the strong parity chromatic number
p. 587-600
Forbidden-minor characterization for the class of cographic element splitting matroids
p. 601-606

Sommaire du Fascicule no. 4

On the forcing geodetic and forcing steiner numbers of a graph
p. 611-624
Some results on semi-total signed graphs
p. 625-638
Complete minors, independent sets, and chordal graphs
p. 639-674
Oriented colouring of some graph products
p. 675-686
Characterization of trees with equal 2-domination number and domination number plus two
p. 687-697
Connected global offensive k-alliances in graphs
p. 699-707
Upper bounds on the b-chromatic number and results for restricted graph classes
p. 709-735
Wiener index of the tensor product of a path and a cycle
p. 737-751
Spanning tree congestion of rook's graphs
p. 753-761
Roman bondage in graphs
p. 763-773
Planar graphs without 4-, 5- and 8-cycles are 3-colorable
p. 775-789
On monochromatic paths and bicolored subdigraphs in arc-colored tournaments
p. 791-820