Geodesic

Volume 41 (2021) no. 2

Sommaire

Total 2-Rainbow Domination Numbers of Trees
p. 345-364
Changing and Unchanging of the Domination Number of a Graph: Path Addition Numbers
p. 365-379
Star-Critical Ramsey Numbers for Cycles versus K4
p. 381-390
H-Kernels in Unions of H-Colored Quasi-Transitive Digraphs
p. 391-408
The Minimum Size of a Graph with Given Tree Connectivity
p. 409-425
On the Star Chromatic Index of Generalized Petersen Graphs
p. 427-439
T-Colorings, Divisibility and the Circular Chromatic Number
p. 441-450
Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
p. 451-468
On Proper (Strong) Rainbow Connection of Graphs
p. 469-479
Internally 4-Connected Graphs with No {Cube, V8}-Minor
p. 481-501
Critical and Flow-Critical Snarks Coincide
p. 503-511
The Vertex-Rainbow Connection Number of Some Graph Operations
p. 513-530
On (p, 1)-Total Labelling of Some 1-Planar Graphs
p. 531-558
Removable Edges on a Hamilton Cycle or Outside a Cycle in a 4-Connected Graph
p. 559-587
Asymptotic Behavior of the Edge Metric Dimension of the Random Graph
p. 589-599
Triameter of Graphs
p. 601-616
Conflict-Free Vertex Connection Number at Most 3 and Size of Graphs
p. 617-632
Restrained Domination in Self-Complementary Graphs
p. 633-645
Fair Total Domination Number in Cactus Graphs
p. 647-664
Block Graphs with Large Paired Domination Multisubdivision Number
p. 665-684
Hamiltonian Cycle Problem in Strong k-Quasi-Transitive Digraphs with Large Diameter
p. 685-690