Geodesic

Sommaire du Fascicule no. 1

On Monochromatic Subgraphs of Edge-Colored Complete Graphs
p. 5-22
Hypergraphs with Pendant Paths are not Chromatically Unique
p. 23-29
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
p. 31-48
A Note on the Permanental Roots of Bipartite Graphs
p. 49-56
Lattice-Like Total Perfect Codes
p. 57-74
Supermagic Graphs Having a Saturated Vertex
p. 75-84
Packing the Hypercube
p. 85-93
The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number
p. 95-102
On the Determinant of q-Distance Matrix of a Graph
p. 103-111
On the Decompositions of Complete Graphs into Cycles and Stars on the Same Number of Edges
p. 113-125
On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs
p. 127-136
Tree-Like Partial Hamming Graphs
p. 137-150
Maximum Hypergraphs without Regular Subgraphs
p. 151-166
On the Complexity of the 3-Kernel Problem in Some Classes of Digraphs
p. 167-185
Smallest Regular Graphs of Given Degree and Diameter
p. 187-191
Star-Cycle Factors of Graphs
p. 193-198
Packing Trees Into n-Chromatic Graphs
p. 199-201

Sommaire du Fascicule no. 2

Motion planning in Cartesian product graphs
p. 207-221
The Ramsey number for theta graph versus a clique of order three and four
p. 223-232
The depression of a graph and k-kernels
p. 233-247
A Ramsey-type theorem for multiple disjoint copies of induced subgraphs
p. 249-261
The irregularity of graphs under graph operations
p. 263-278
On the uniqueness of $D$-vertex magic constant
p. 279-286
Heavy subgraph pairs for traceability of block-chains
p. 287-307
Rank numbers for bent ladders
p. 309-329
A decomposition of Gallai multigraphs
p. 331-352
The niche graphs of interval orders
p. 353-359
Families of triples with high minimum degree are Hamiltonian
p. 361-381
On degree sets and the minimum orders in bipartite graphs
p. 383-390
On Eulerian irregularity in graphs
p. 391-408
A note on $PM$-compact bipartite graphs
p. 409-413
Maximal buttonings of trees
p. 415-420
A note on face coloring entire weightings of plane graphs
p. 421-426

Sommaire du Fascicule no. 3

On the existence of (k,l)-kernels in infinite digraphs: A survey
p. 431-466
Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms
p. 467-495
Two graphs with a common edge
p. 497-507
A characterization of 2-tree probe interval graphs
p. 509-527
A reduction of the Graph Reconstruction Conjecture
p. 529-537
5-stars of low weight in normal plane maps with minimum degree 5
p. 539-546
Chromatic polynomials of mixed hypercycles
p. 547-558
Characterization of cubic graphs $G$ with $ir_t(G)=IR_t(G)=2$
p. 559-565
Tetravalent arc-transitive graphs of order $3p^2$
p. 567-575
On the independence number of edge chromatic critical graphs
p. 577-584
Degree sequences of monocore graphs
p. 585-592
Maxclique and unit disk characterizations of strongly chordal graphs
p. 593-602
Downhill domination in graphs
p. 603-612
On twin edge colorings of graphs
p. 613-627
The domination number of $K_n^3$
p. 629-632
A different short proof of Brook's theorem
p. 633-634
On the Erdős-Gyárfás conjecture in claw-free graphs
p. 635-640
A note on a broken-cycle theorem for hypergraphs
p. 641-646

Sommaire du Fascicule no. 4

Some remarks on the structure of strong $k$-transitive digraphs
p. 651-671
Pairs of edges as chords and as cut-edges
p. 673-681
The connectivity of domination dot-critical graphs with no critical vertices
p. 683-690
On super edge-antimagic total labeling of subdivided stars
p. 691-706
Color energy of a unitary Cayley graph
p. 707-721
Strong chromatic index of planar graphs with large girth
p. 723-733
Extremal unicyclic graphs with minimal distance spectral radius
p. 735-749
Centrosymmetric graphs and a lower bound for graph energy of fullerenes
p. 751-768
The 1,2,3-Conjecture and 1,2-Conjecture for sparse graphs
p. 769-799
An implicit weighted degree condition for heavy cycles
p. 801-810
The well-covered dimension of products of graphs
p. 811-827
Characterization of super-radial graphs
p. 829-848
A note on vertex colorings of plane graphs
p. 849-855
The smallest nonevasive graph property
p. 857-862