Sommaire

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
Some Sharp Bounds on the Negative Decision Number of Graphs
p. 649
The Phylogeny Graphs of Doubly Partial Orders
p. 657
Generalized Fractional Total Colorings of Complete Graph
p. 665
Weak Saturation Numbers for Sparse Graphs
p. 677
Symmetric Hamilton Cycle Decompositions of Complete Multigraphs
p. 695
Bounds on the Signed 2-Independence Number in Graphs
p. 709
The Distance Roman Domination Numbers of Graphs
p. 717
Path-Neighborhood Graphs
p. 731
The B-Domatic Number of a Graph
p. 747
Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs
p. 759
Almost-Rainbow Edge-Colorings of Some Small Subgraphs
p. 771
Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs
p. 785