Geodesic

Sommaire du Fascicule no. 1

Extremal graphs for even linear forests in bipartite graphs
p. 5-16
On distance magic labelings of Hamming graphs and folded hypercubes
p. 17-33
An improved bound on the chromatic number of the Pancake graphs
p. 35-46
Minimal graphs with disjoint dominating and total dominating sets
p. 47-74
Lower boundary independent broadcasts in trees
p. 75-99
Edge intersection hypergraphs
p. 101-126
Determining number and cost of generalized Mycielskian graphs
p. 127-150
Set-sequential labelings of odd trees
p. 151-170
Graph grabbing game on graphs with forbidden subgraphs
p. 171-197
On the broadcast independence number of locally uniform 2-lobsters
p. 199-230
On a graph labelling conjecture involving coloured labels
p. 231-244
Cycles of many lengths in balanced bipartite digraphs on dominating and dominated degree conditions
p. 245-267
Beta invariant and chromatic uniqueness of wheels
p. 269-280
Cubic graphs having only k-cycles in each 2-factor
p. 281-296
On $s$-hamiltonian-connected line graphs
p. 297-315
Adjacent vertex distinguishing total coloring of the corona product of graphs
p. 317-335
Chorded $k$-pancyclic and weakly $k$-pancyclic graphs
p. 337-350
2-nearly Platonic graphs
p. 351-362
Edge degree conditions for dominating and spanning closed trails
p. 363-381
On the equality of domination number and 2-domination number
p. 383-406

Sommaire du Fascicule no. 2

The achromatic number of the Cartesian product of $K_6$ and $K_q$
p. 411-433
Linear arboricity of 1-planar graphs
p. 435-457
The decycling number of a planar graph covered by $K_4$-subgraphs
p. 459-473
The linear arboricity of graphs with low treewidth
p. 475-487
$L(2,1)$-labeling of the iterated Mycielski graphs of graphs and some problems related to matching problems
p. 489-518
Panchromatic patterns by paths
p. 519-537
Bounds on the global double Roman domination number in graphs
p. 539-554
Degree sum condition for vertex-disjoint 5-cycles
p. 555-574
Outer connected domination in maximal outerplanar graphs and beyond
p. 575-590
Fault-tolerant identifying codes in special classes of graphs
p. 591-611
Edge precoloring extension of trees II
p. 613-637
$(k,H)$-kernels in nearly tournaments
p. 639-662
Strong incidence colouring of graphs
p. 663-689
On the Strong Path Partition Conjecture
p. 691-715
A note on minimum degree, bipartite holes, and Hamiltonian properties
p. 717-726
Resistance in regular class two graphs
p. 727-736
Approximate and exact results for the harmonious chromatic number
p. 737-754
A $\sigma_3$ condition for arbitrarily partitionable graphs
p. 755-776
The matching extendability of 7-connected maximal 1-plane graphs
p. 777-790
The generalized 3-connectivity and 4-connectivity of crossed cube
p. 791-811

Sommaire du Fascicule no. 3

Coloring squares of planar graphs with small maximum degree
p. 817-835
On walk domination: weakly toll domination, $l_2$ and $l_3$ domination
p. 837-861
On proper $2$-labellings distinguishing by sums, multisets or products
p. 863-878
Dominated pair degree sum conditions of supereulerian digraphs
p. 879-891
The $m$-bipartite Ramsey number $BR_m(H_1,H_2)$
p. 893-911
Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs
p. 913-931
On the total domination number of total graphs
p. 933-951
Rainbow disjoint union of clique and matching in edge-colored complete graph
p. 953-970
Spectral bounds for the zero forcing number of a graph
p. 971-982
On the $k$-independence number of graph products
p. 983-996
An extremal problem for the neighborhood Lights Out game
p. 997-1021
Graph classes equivalent to 12-representable graphs
p. 1023-1035
All tight descriptions of faces in plane triangulations with minimum degree~4
p. 1037-1050
A study of a combination of distance domination and resolvability in graphs
p. 1051-1078
The generalized 4-connectivity of balanced hypercubes
p. 1079-1106
High-ordered spectral characterization of unicyclic graphs
p. 1107-1141
Connectedness and cycle spaces of friends-and-strangers graphs
p. 1143-1168
On the vertex position number of graphs
p. 1169-1188
An analogue of quasi-transitivity for edge-coloured graphs
p. 1189-1215
Hypergraph operations preserving sc-greediness
p. 1217-1241

Sommaire du Fascicule no. 4

A Chvátal-Erdős type theorem for path-connectivity
p. 1247-1260
Total vertex product irregularity strength of graphs
p. 1261-1276
Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products
p. 1277-1291
Global dominated coloring of graphs
p. 1293-1309
Strong chromatic index of claw-free graphs with edge weight seven
p. 1311-1325
Chromatic Ramsey numbers of generalised Mycielski graphs
p. 1327-1339
Optimal adjacent vertex-distinguishing edge-colorings of circulant graphs
p. 1341-1359
Disjoint maximal independent sets in graphs and hypergraphs
p. 1361-1371
Semitotal forcing in claw-free cubic graphs
p. 1373-1393
Fractional eternal domination: securely distributing resources across a network
p. 1395-1428
Spanning trails avoiding and containing given edges
p. 1429-1447
On the edge-sum distinguishing game
p. 1449-1469
$k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$
p. 1471-1484
Critical aspects in broadcast domination
p. 1485-1512
The Turán number of three disjoint paths
p. 1513-1537
On weakly Turán-good graphs
p. 1539-1550
Connected coalitions in graphs
p. 1551-1566
General sharp upper bounds on the total coalition number
p. 1567-1584
Semitotal domination in claw-free graphs
p. 1585-1605
Online size Ramsey number for $C_4$ and $P_6$
p. 1607-1615
The maximum number of edges in a $\{K_{r+1},M_{k+1}\}$-free graph
p. 1617-1629
On non-hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs
p. 1631-1646