
Fine paths are a popular modification of Dyck paths that are not allowed to have "hills". Enumerating Fine paths of length 2n are the Fine numbers (F-n)(n >= 0), a well-studied integer sequence that shares many properties with the Catalan numbers. In this paper, we investigate a two-parameter generalization of the Fine numbers known as the (k, r)-Fine numbers (F-n(k,r ) )(n >= 0), with the k parameter (k >= 2) mirroring the generalization of the Catalan numbers to the Fuss-Catalan numbers, and the r parameter (1 <= r <= k-1) corresponding to competing definitions of "hills" in k-Dyck paths. Generating functions are derived for all classes of (k, r)-Fine numbers, and these generating functions are used to generalize many pre-existing results involving the Fine numbers. We also use Riordan arrays to provide an additional combinatorial interpretation of all (k, r)-Fine numbers as certain classes of colored, higher-order Motzkin paths. We close the paper with asymptotic results studying the behavior of the (k, r)-Fine numbers as n -> infinity.
For a non-decreasing sequence of integers S = (s(1), s(2), ..., s(k)), an Spacking coloring of G is a partition of V(G) into k subsets I-1, I-2, ..., I-k such that the distance between any two distinct vertices u, v is an element of I-i is greater than s(i), for any i such that 1 <= i <= k. Gastineau and Togni [Discrete Math. 339 (2016), 2461-2470] asked whether a subcubic graph is (1, 2, 2, 2, 2, 2)-and (1, 1, 2, 3)-packing colorable, except the Petersen graph. Recently, Bre & scaron;ar, Kuenzel, and Rall [Discrete Math. 348(8) (2025), 114477] proved that every claw-free subcubic graph is (1, 1, 2, 2)-packing colorable. The local girth of a vertex v in a graph is the length of the shortest cycle containing v. Hence, a claw-free subcubic graph is a subcubic graph where every vertex of degree 3 has local girth 3. In this paper, we prove that every subcubic graph such that every vertex of degree 3 has local girth at most 4 is (1, 2, 2, 2, 2, 2)-packing colorable.
Let P-m boxed times C-n be the strong product on P-m and C-n, where P-m and C-n are the path and the cycle on m and n vertices, respectively. In 2018 Ouyang, Wang, and Huang conjectured that the crossing number of P-m boxed times C-n is (m-1)n for m >= 3 and n >= 3. In this paper we confirm the correctness of the conjecture, and we determine the crossing number of a spanning graph of P-m boxed times C-n.
A generalized orientation of a graph is the one where both orientations of edges are allowed at the same time. We prove that complete multipartite graphs are characterized by the following property: any generalized orientation without sources has a watchman's walk. We also characterize graphs satisfying this and a related property in the case of simple orientations. Our main result establishes an upper bound for the watchman's number w(D) for complete multipartite digraphs D without sources: w(D) <= gamma(D) + 2 alpha(D), where gamma(D) is the domination number and alpha(D) is the independence number of D. This result extends the upper bound previously established for tournaments by Dyer, Howell and Pittman in 2021.
In this paper we introduce strongly connected t-colorings, which allow us to extend the concept of a connected Ramsey number to the t-color setting, when t >= 3. After proving some general results concerning such colorings, we determine the exact values of the connected Ramsey numbers r(c)(t)(K-1,K-n), r(c)(3)(K1,3, K1,4, K1,4), r(c)(3)(P4), r(c)(3)(P5), and r(c)(3)(P6), where K1,n denotes a star of order n + 1, and Pn denotes a path of order n. The paper concludes with some lower bounds, a conjecture, and a discussion concerning future directions of research.