Geodesic

Sommaire du Fascicule no. 1

Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
p. 5-13
3-Tuple Total Domination Number of Rook’s Graphs
p. 15-37
On L(2, 1)-Labelings of Oriented Graphs
p. 39-46
Open Locating-Dominating Sets in Circulant Graphs
p. 47-62
Bounds on Watching and Watching Graph Products
p. 63-79
Minimum Coverings of Crowns with Cycles and Stars
p. 81-88
An Analogue of DP-Coloring for Variable Degeneracy and its Applications
p. 89-99
Recursion Relations for Chromatic Coefficients for Graphs and Hypergraphs
p. 101-121
Guarding a Subgraph as a Tool in Pursuit-Evasion Games
p. 123-138
Protection of Lexicographic Product Graphs
p. 139-158
On {a, b}-Edge-Weightings of Bipartite Graphs with Odd a, b
p. 159-185
Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs
p. 187-196
The Crossing Number of Hexagonal Graph H3,n in the Projective Plane
p. 197-218
Asymptotic Enumeration of Non-Uniform Linear Hypergraphs
p. 219-230
The Semitotal Domination Problem in Block Graphs
p. 231-248
On the ρ-Edge Stability Number of Graphs
p. 249-262
Packing Trees in Complete Bipartite Graphs
p. 263-275
The Star Dichromatic Number
p. 277-298
Spanning Trees with Disjoint Dominating and 2-Dominating Sets
p. 299-308
On Hamiltonian Cycles in Claw-Free Cubic Graphs
p. 309-313
Corrigendum to: Bounds on the Number of Edges of Edge-Minimal, Edge-Maximal and l -Hypertrees [Discussiones Mathematicae Graph Theory 36 (2016) 259–278]
p. 315-316

Sommaire du Fascicule no. 2

On the Optimality of 3-Restricted Arc Connectivity for Digraphs and Bipartite Digraphs
p. 321-332
Further Results on Packing Related Parameters in Graphs
p. 333-348
Gallai-Ramsey Numbers for Rainbow $S_3^+$ and Monochromatic Paths
p. 349-362
b-Coloring of the Mycielskian of Some Classes of Graphs
p. 363-381
On the 12-Representability of Induced Subgraphs of a Grid Graph
p. 383-403
Branch-Weight Unique Trees
p. 405-416
Forbidden Subgraphs for Collapsible Graphs and Supereulerian Graphs
p. 417-442
Labeled Packing of Cycles and Circuits
p. 443-469
High Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges
p. 471-484
Arbitrarily Partitionable {2K2, C4}-Free Graphs
p. 485-500
Game-Perfect Semiorientations of Forests
p. 501-534
Describing Minor 5-Stars in 3-Polytopes with Minimum Degree 5 and No Vertices of Degree 6 or 7
p. 535-548
On Face Irregular Evaluations of Plane Graphs
p. 549-568
Graphs that are Critical for the Packing Chromatic Number
p. 569-589
An O(mn2) Algorithm for Computing the Strong Geodetic Number in Outerplanar Graphs
p. 591-599
Corrigendum to: Independent Transversal Domination in Graphs [Discuss. Math. Graph Theory 32 (2012) 5–17]
p. 601-611
A Classification of Cactus Graphs According to their Domination Number
p. 613-626
On Well-Covered Direct Products
p. 627-640
Roman {2}-Domination Problem in Graphs
p. 641-660

Sommaire du Fascicule no. 3

Bounds on Domination Parameters in Graphs: A Brief Survey
p. 665-708
Algorithmic Aspects of the Independent 2-Rainbow Domination Number and Independent Roman {2}-Domination Number
p. 709-726
Nowhere-Zero Unoriented 6-Flows on Certain Triangular Graphs
p. 727-746
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
p. 747-758
Minimally Strong Subgraph (k, ℓ)-Arc-Connected Digraphs
p. 759-770
Total Coloring of Claw-Free Planar Graphs
p. 771-777
Graphs with Unique Maximum Packing of Closed Neighborhoods
p. 779-797
Oriented Chromatic Number of Cartesian Products $ P_m \square P_n $ and $ C_m \square P_n $
p. 799-810
Ascending Subgraph Decompositions of Oriented Graphs that Factor into Triangles
p. 811-822
Efficient Domination in Cayley Graphs of Generalized Dihedral Groups
p. 823-841
Hamiltonian Extendable Graphs
p. 843-859
The Roman Domatic Problem in Graphs and Digraphs: A Survey
p. 861-891
Some Properties of the Eigenvalues of the Net Laplacian Matrix of a Signed Graph
p. 893-903
Separation of Cartesian Products of Graphs Into Several Connected Components by the Removal of Vertices
p. 905-920
New Results Relating Independence and Matchings
p. 921-935
Total Roman {2}-Dominating Functions in Graphs
p. 937-958
Trees Whose Even-Degree Vertices Induce a Path are Antimagic
p. 959-966
Total Protection of Lexicographic Product Graphs
p. 967-984
Extremal Digraphs Avoiding Distinct Walks of Length 4 with the Same Endpoints
p. 985-1004
A New Upper Bound for the Perfect Italian Domination Number of a Tree
p. 1005-1022

Sommaire du Fascicule no. 4

Distance-Local Rainbow Connection Number
p. 1027-1039
Flippable Edges in Triangulations on Surfaces
p. 1041-1059
Singular Turán Numbers and Worm-Colorings
p. 1061-1074
On Mf-Edge Colorings of Graphs
p. 1075-1088
Decomposing 10-Regular Graphs into Paths of Length 5
p. 1089-1097
(C3, C4, C5, C7)-Free Almost Well-Dominated Graphs
p. 1099-1117
The Turán Number for 4 · Sℓ
p. 1119-1128
Bounds on the Double Italian Domination Number of a Graph
p. 1129-1137
Finding Dominating Induced Matchings in P9-Free Graphs in Polynomial Time
p. 1139-1162
Cyclic Permutations in Determining Crossing Numbers
p. 1163-1183
More on the Rainbow Disconnection in Graphs
p. 1185-1204
Antimagic Labeling of Some Biregular Bipartite Graphs
p. 1205-1218
On Small Balanceable, Strongly-Balanceable and Omnitonal Graphs
p. 1219-1235
More Aspects of Arbitrarily Partitionable Graphs
p. 1237-1261
Representing Split Graphs by Words
p. 1263-1280
Nested Locally Hamiltonian Graphs and the Oberly-Sumner Conjecture
p. 1281-1312
More on Signed Graphs with at Most Three Eigenvalues
p. 1313-1331
Covering the Edges of a Random Hypergraph by Cliques
p. 1333-1349
On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs
p. 1351-1382
A Note on Packing of Uniform Hypergraphs
p. 1383-1388