Geodesic

Sommaire du Fascicule no. 1

Dense Arbitrarily Partitionable Graphs
p. 5-22
Split Euler Tours In 4-Regular Planar Graphs
p. 23-30
Note On The Game Colouring Number Of Powers Of Graphs
p. 31-42
Products Of Digraphs And Their Competition Graphs
p. 43-58
M2-Edge Colorings Of Cacti And Graph Joins
p. 59-69
Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree
p. 71-93
Unique-Maximum Coloring Of Plane Graphs
p. 95-102
$ \gamma $-Cycles In Arc-Colored Digraphs
p. 103-116
Maximum Edge-Colorings Of Graphs
p. 117-125
On Spectra Of Variants Of The Corona Of Two Graphs And Some New Equienergetic Graphs
p. 127-140
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
p. 141-151
Bounds On The Disjunctive Total Domination Number Of A Tree
p. 153-171
A Fan-Type Heavy Pair Of Subgraphs For Pancyclicity Of 2-Connected Graphs
p. 173-184
Weak Total Resolvability In Graphs
p. 185-210
Supermagic Generalized Double Graphs
p. 211-225
Light Graphs In Planar Graphs Of Large Girth
p. 227-238

Sommaire du Fascicule no. 2

Hamiltonicity and Generalised Total Colourings of Planar Graphs
p. 243-257
Bounds on the Number of Edges of Edge-Minimal, Edge-Maximal and L-Hypertrees
p. 259-278
Solutions of Some L(2, 1)-Coloring Related Open Problems
p. 279-297
Distance Magic Cartesian Products of Graphs
p. 299-308
Kernels by Monochromatic Paths and Color-Perfect Digraphs
p. 309-321
A Maximum Resonant Set of Polyomino Graphs
p. 323-337
3-Paths in Graphs with Bounded Average Degree
p. 339-353
Hardness Results for Total Rainbow Connection of Graphs
p. 355-362
Large Degree Vertices in Longest Cycles of Graphs, I
p. 363-382
Heavy Subgraph Conditions for Longest Cycles to Be Heavy in Graphs
p. 383-392
End Simplicial Vertices in Path Graphs
p. 393-408
A Neighborhood Condition for Fractional ID-[A, B]-Factor-Critical Graphs
p. 409-418
The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
p. 419-426
A Characterization of Hypergraphs with Large Domination Number
p. 427-438
Characterizations of Graphs Having Large Proper Connection Numbers
p. 439-453
The Steiner Wiener Index of A Graph
p. 455-465
New Bounds on the Signed Total Domination Number of Graphs
p. 467-477
The Quest for A Characterization of Hom-Properties of Finite Character
p. 479-500

Sommaire du Fascicule no. 3

Extremal Matching Energy of Complements of Trees
p. 505-521
Cycle Double Covers of Infinite Planar Graphs
p. 523-544
Looseness and Independence Number of Triangulations on Closed Surfaces
p. 545-554
A New Proof that 4-Connected Planar Graphs are Hamiltonian-Connected
p. 555-564
On Longest Cycles in Essentially 4-Connected Planar Graphs
p. 565-575
The Smallest Non-Autograph
p. 577-602
On the Weight of Minor Faces in Triangle-Free 3-Polytopes
p. 603-619
The Ryjáček Closure and a Forbidden Subgraph
p. 621-628
Various Bounds for Liar’s Domination Number
p. 629-641
Triangle Decompositions of Planar Graphs
p. 643-659
Some Variations of Perfect Graphs
p. 661-668
The Vertex-Rainbow Index of A Graph
p. 669-681
The Turán Number of the Graph 2P5
p. 683-694
Nordhaus-Gaddum-Type Results for Resistance Distance-Based Graph Invariants
p. 695-707
Sum List Edge Colorings of Graphs
p. 709-722
Splitting Cubic Circle Graphs
p. 723-741
On Path-Pairability in the Cartesian Product of Graphs
p. 743-758
K3-WORM Colorings of Graphs: Lower Chromatic Number and Gaps in the Chromatic Spectrum
p. 759-772
Spanning Trees whose Stems have a Bounded Number of Branch Vertices
p. 773-778

Sommaire du Fascicule no. 4

Perfect Set of Euler Tours of Kp,p,p
p. 783-796
Integral Cayley Sum Graphs and Groups
p. 797-803
On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes
p. 805-817
Niche Hypergraphs
p. 819-832
Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs
p. 833-843
Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges
p. 845-856
Edge-Transitive Lexicographic and Cartesian Products
p. 857-865
The Gutman Index and the Edge-Wiener Index of Graphs with Given Vertex-Connectivity
p. 867-876
On the Complexity of Reinforcement in Graphs
p. 877-887
An Extension of Kotzig’s Theorem
p. 889-897
The Dynamics of the Forest Graph Operator
p. 899-913
Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
p. 915-929
Graphs with Large Generalized (Edge-)Connectivity
p. 931-958
Bounds for the b-Chromatic Number of Subgraphs and Edge-Deleted Subgraphs
p. 959-976
Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs
p. 977-988
Vertex Colorings without Rainbow Subgraphs
p. 989-1005
Radio Graceful Hamming Graphs
p. 1007-1020
A Note on Path Domination
p. 1021-1034
Edge-Transitivity of Cayley Graphs Generated by Transpositions
p. 1035-1042
A Note on Non-Dominating Set Partitions in Graphs
p. 1043-1050
Closed Formulae for the Strong Metric Dimension of Lexicographic Product Graphs
p. 1051-1064