Geodesic

Sommaire du Fascicule no. 1

Hereditarnia
p. 7
On the Non-(p−1)-Partite Kp-Free Graphs
p. 9-23
Coloring Some Finite Sets in $ \mathbb{R}^n $
p. 25-31
Universality for and in Induced-Hereditary Graph Properties
p. 33-47
A Note on the Uniqueness of Stable Marriage Matching
p. 49-55
When is an Incomplete 3 × n Latin Rectangle Completable?
p. 57-69
On Vertices Enforcing a Hamiltonian Cycle
p. 71-89
Acyclic 6-Colouring of Graphs with Maximum Degree 5 and Small Maximum Average Degree
p. 91-99
On Minimum (Kq, k) Stable Graphs
p. 101-115
A Survey of the Path Partition Conjecture
p. 117-131
A Note on Barnette’s Conjecture
p. 133-137
On Graphs with Disjoint Dominating and 2-Dominating Sets
p. 139-146
On Maximum Weight of a Bipartite Graph of Given Order and Size
p. 147-165
Fractional (\( \mathcal{P} , \mathcal{Q} \))-Total List Colorings of Graphs
p. 167-179
Rainbow Connection In Sparse Graphs
p. 181-192
A Note on Uniquely Embeddable Forests
p. 193-201
Distance-Locally Disconnected Graphs
p. 203-215
Sums of Powered Characteristic Roots Count Distance-Independent Circular Sets
p. 217-229
Choice-Perfect Graphs
p. 231-242

Sommaire du Fascicule no. 2

4-Transitive Digraphs I: The Structure of Strong 4-Transitive Digraphs
p. 247-260
Independent Detour Transversals in 3-Deficient Digraphs
p. 261-275
Exact Expectation and Variance of Minimal Basis of Random Matroids
p. 277-288
Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)
p. 289-306
On the Rainbow Vertex-Connection
p. 307-313
The Incidence Chromatic Number of Toroidal Grids
p. 315-327
Frucht’s Theorem for the Digraph Factorial
p. 329-336
Strong Equality Between the Roman Domination and Independent Roman Domination Numbers in Trees
p. 337-346
The Balanced Decomposition Number of $ TK_4 $ and Series-Parallel Graphs
p. 347-359
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
p. 361-371
Star Coloring of Subcubic Graphs
p. 373-385
On the Domination of Cartesian Product of Directed Cycles: Results for Certain Equivalence Classes of Lengths
p. 387-394
A Characterization of Trees for a New Lower Bound on the K-Independence Number
p. 395-410
On Closed Modular Colorings of Trees
p. 411-428
Underlying Graphs of 3-Quasi-Transitive Digraphs and 3-Transitive Digraphs
p. 429-435
Edge Dominating Sets and Vertex Covers
p. 437-456
Two Short Proofs on Total Domination
p. 457-459
A Tight Bound on the Set Chromatic Number
p. 461-465
The Path-Distance-Width of Hypercubes
p. 467-470

Sommaire du Fascicule no. 3

Universality in Graph Properties with Degree Restrictions
p. 477-492
γ-Cycles And Transitivity By Monochromatic Paths In Arc-Coloured Digraphs
p. 493-507
Fractional -Edge-Coloring of Graphs
p. 509-519
Decompositions of Plane Graphs Under Parity Constrains Given by Faces
p. 521-530
Counting Maximal Distance-Independent Sets in Grid Graphs
p. 531-557
Maximum Semi-Matching Problem in Bipartite Graphs
p. 559-569
The Crossing Numbers of Products of Path with Graphs of Order Six
p. 571-582
On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six
p. 583-597
Broken Circuits in Matroids—Dohmen’s Inductive Proof
p. 599-602
Rainbow Connection Number of Dense Graphs
p. 603-611
Interval Edge-Colorings of Cartesian Products of Graphs I
p. 613-632

Sommaire du Fascicule no. 4

Characterizations of the Family of All Generalized Line Graphs—Finite and Infinite—and Classification of the Family of All Graphs Whose Least Eigenvalues ≥ −2
p. 637-648
Some Sharp Bounds on the Negative Decision Number of Graphs
p. 649-656
The Phylogeny Graphs of Doubly Partial Orders
p. 657-664
Generalized Fractional Total Colorings of Complete Graph
p. 665-676
Weak Saturation Numbers for Sparse Graphs
p. 677-693
Symmetric Hamilton Cycle Decompositions of Complete Multigraphs
p. 695-707
Bounds on the Signed 2-Independence Number in Graphs
p. 709-715
The Distance Roman Domination Numbers of Graphs
p. 717-730
Path-Neighborhood Graphs
p. 731-745
The b-Domatic Number of a Graph
p. 747-757
Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs
p. 759-770
Almost-Rainbow Edge-Colorings of Some Small Subgraphs
p. 771-784
Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs
p. 785-790