Geodesic

Volume 41 (2021) no. 1

Sommaire

A Survey on the Cyclic Coloring and its Relaxations
p. 5-38
Domination Number, Independent Domination Number and 2-Independence Number in Trees
p. 39-49
Linear List Coloring of Some Sparse Graphs
p. 51-64
Minimal Graphs with Respect to Geometric Distance Realizability
p. 65-73
On the n-Partite Tournaments with Exactly n − m + 1 Cycles of Length m
p. 75-82
Large Contractible Subgraphs of a 3-Connected Graph
p. 83-101
Generalized Hypergraph Coloring
p. 103-121
Dominating Vertex Covers: The Vertex-Edge Domination Problem
p. 123-132
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs
p. 133-152
Intersection Dimension and Graph Invariants
p. 153-166
On Implicit Heavy Subgraphs and Hamiltonicity of 2-Connected Graphs
p. 167-181
The Crossing Number of Cartesian Product of 5-Wheel with any Tree
p. 183-197
List Edge Coloring of Planar Graphs without 6-Cycles with Two Chords
p. 199-211
Independent Transversal Total Domination versus Total Domination in Trees
p. 213-224
On Grundy Total Domination Number in Product Graphs
p. 225-247
Decomposition of the Tensor Product of Complete Graphs into Cycles of Lengths 3 and 6
p. 249-266
A Constructive Characterization of Vertex Cover Roman Trees
p. 267-283
Dualizing Distance-Hereditary Graphs
p. 285-296
Arc-Disjoint Hamiltonian Paths in Strong Round Decomposable Local Tournaments
p. 297-310
Coverings of Cubic Graphs and 3-Edge Colorability
p. 311-334
Graph Exponentiation and Neighborhood Reconstruction
p. 335-339