Geodesic

Sommaire du Fascicule no. 1

The existence of path-factor covered graphs
p. 5-16
On conditional connectivity of the Cartesian product of cycles
p. 17-34
Unique minimum semipaired dominating sets in trees
p. 35-53
Burnside chromatic polynomials of group-invariant graphs
p. 55-76
Equimatchable bipartite graphs
p. 77-94
Domination parameters of the unitary Cayley graph of $\mathbb{Z} // n\mathbb{Z}$
p. 95-114
Efficient $(j, k)$-dominating functions
p. 115-135
Elimination properties for minimal dominating sets of graphs
p. 137-149
Improved bounds for some facially constrained colorings
p. 151-158
More tales of Hoffman: bounds for the vector chromatic number of a graph
p. 159-169
A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces
p. 171-177
On the sizes of $(k,l)$-edge-maximal $r$-uniform hypergraphs
p. 179-194
The threshold dimension and irreducible graphs
p. 195-210
Forbidden subgraphs for existences of (connected) 2-factors of a graph
p. 211-224
Extending Potočnik and Šajna's conditions on the existence of vertex-transitive self-complementary $k$-hypergraphs
p. 225-231
Some results on path-factor critical avoidable graphs
p. 233-244
On the metric dimensions for sets of vertices
p. 245-275
The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem
p. 277-286
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without $4$-cycles and $7$-cycles
p. 287-297

Sommaire du Fascicule no. 2

The Turán number of spanning star forests
p. 303-312
Domination game: Effect of edge contraction and edge subdivision
p. 313-329
On the Ramsey numbers of non-star trees versus connected graphs of order six
p. 331-349
Scaffold for the polyhedral embedding of cubic graphs
p. 351-384
Vertex partitioning of graphs into odd induced subgraphs
p. 385-399
Strengthening some complexity results on toughness of graphs
p. 401-419
Daisy Hamming graphs
p. 421-436
About an extremal problem of bigraphic pairs with a realization containing $K_{s,t}$
p. 437-444
Optimal error-detecting open-locating-dominating set on the infinite triangular grid
p. 445-455
A note on forcing 3-repetitions in degree sequences
p. 457-462
Identifying codes in the direct product of a path and a complete graph
p. 463-486
Metric dimension and diameter in bipartite graphs
p. 487-498
Countable graphs are majority 3-choosable
p. 499-506
The walks and CDC of graphs with the same main eigenspace
p. 507-532
On semi-transitive orientability of triangle-free graphs
p. 533-547
Generalized Turán problems for small graphs
p. 549-572
A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths
p. 573-581

Sommaire du Fascicule no. 3

Total 2-domination number in digraphs and its dual parameter
p. 587-606
A note about monochromatic components in graphs of large minimum degree
p. 607-618
Zero and total forcing dense graphs
p. 619-634
Edge-maximal graphs with cutwidth at most three
p. 635-657
The neighbor-locating-chromatic number of trees and unicyclic graphs
p. 659-675
The Petersen and Heawood graphs make up graphical twins via induced matchings
p. 677-683
On subgraphs with prescribed eccentricities
p. 685-702
An upper bound on the chromatic number of 2-planar graphs
p. 703-720
Double Roman and double Italian domination
p. 721-730
A characterization of internally 4-connected $\{P_{10}− \{v_1,v_2\}\}$-minor-free graphs
p. 731-742
Choosability with separation of cycles and outerplanar graphs
p. 743-760
Two sufficient conditions for component factors in graphs
p. 761-766
Well-covered token graphs
p. 767-792
Minimizing the number of complete bipartite graphs in a $K_s$-saturated graph
p. 793-807
New bounds on domination and independence in graphs
p. 809-824
Hop domination in chordal bipartite graphs
p. 825-840
Relationship among B1-EPG, VPT and EPT graphs classes
p. 841-858
Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs
p. 859-874

Sommaire du Fascicule no. 4

New results on Type 2 snarks
p. 879-893
The graph grabbing game on blow-ups of trees and cycles
p. 895-907
Strong and weak Perfect Digraph Theorems for perfect, $\alpha$-perfect and strictly perfect digraphs
p. 909-930
Coalition graphs of paths, cycles, and trees
p. 931-946
Vertex-edge domination in interval and bipartite permutation graphs
p. 947-963
Acyclic chromatic index of IC-planar graphs
p. 965-978
On the $\rho$-subdivision number of graphs
p. 979-997
A characterization of uniquely representable graphs
p. 999-1017
On $q$-connected chordal graphs with minimum number of spanning trees
p. 1019-1032
Bounds on the total double Roman domination number of graphs
p. 1033-1061
On $P_5$-free locally split graphs
p. 1063-1090
$ \mathcal{l} $-covering $k$-hypergraphs are quasi-eulerian
p. 1091-1102
The achromatic number of $K_6\square K_q$ equals $2q+3$ if $q\ge41$ is odd
p. 1103-1121
The niche graphs of multipartite tournaments
p. 1123-1146
Total and paired domination stability in prisms
p. 1147-1169
Biregular (and regular) planar cages
p. 1171-1194
Spanning trees with a bounded number of branch vertices in a $K_{1,4}$-free graph
p. 1195-1202
Biholes in balanced bipartite graphs
p. 1203-1213
$L(p,q)$-labeling of graphs with interval representations
p. 1215-1235
Helly and strong Helly numbers of $B_k$-EPG and $B_k$-VPG graphs
p. 1237-1252
Extremal graphs and classification of planar graphs by MC-numbers
p. 1253-1272