We first introduce the concept of \((k, k’, k”)\)-domination numbers in graphs, which is a generalization of many domination parameters. Then we find lower and upper bounds for this parameter, which improve many well-known results in the literature.

We are interested in ordering the elements of a subset \( A \) of the non-zero integers modulo \( n \) in such a way that all the partial sums are distinct. We conjecture that this can always be done, and we prove various partial results about this problem.

A graph \( G \) with maximum degree \( \Delta \) and edge chromatic number \( \chi'(G) > \Delta \) is \emph{edge-\(\Delta\)-critical} if \( \chi'(G-e) = \Delta \) for each \( e \in E(G) \). In this article, we provide a new proof of adjacency Lemmas on edge-critical graphs such that Vizing’s adjacency lemma becomes a corollary of our results.

This paper surveys recent results for flag enumeration of polytopes, Bruhat graphs, balanced digraphs, Whitney stratified spaces and quasi-graded posets.

A bipancyclic graph on \( v \) vertices is a bipartite graph that contains, as subgraphs, cycles of length \( n \) for every even integer \( n \) such that \( 4 \leq n \leq v \). Such a graph is uniquely bipancyclic if it contains exactly one subgraph of each permissible length.

In this paper, we find all uniquely bipancyclic graphs on 30 or fewer vertices.

A balanced complete bipartite graph is a complete bipartite graph where the degrees of its vertices differ by at most 1. In a red-blue-green coloring of the edges of a graph \( G \), every edge of \( G \) is colored red, blue, or green. For three graphs \( F_1 \), \( F_2 \), and \( F_3 \), the 2-Ramsey number \( R_2(F_1, F_2, F_3) \) of \( F_1 \), \( F_2 \), and \( F_3 \), if it exists, is the smallest order of a balanced complete bipartite graph \( G \) such that every red-blue-green coloring of the edges of \( G \) contains a red \( F_1 \), a blue \( F_2 \), or a green \( F_3 \). In this note, we determine that

\[
20 \leq R_2(C_4, C_4, C_4) \leq 21.
\]

A Hamiltonian graph \( G \) is said to be \(\ell\)-path-Hamiltonian, where \(\ell\) is a positive integer less than or equal to the order of \( G \), if every path of order \(\ell\) in \( G \) is a subpath of some Hamiltonian cycle in \( G \). The Hamiltonian cycle extension number of \( G \) is the maximum positive integer \(\ell\) for which every path of order \(\ell\) or less is a subpath of some Hamiltonian cycle in \( G \). If the order of \( G \) equals \( n \), then it is known that \( \text{hce}(G) = n \) if and only if \( G \) is a cycle or a regular complete bipartite graph (when \( n \) is even) or a complete graph. We present a complete characterization of Hamiltonian graphs of order \( n \) that are \(\ell\)-path-Hamiltonian for each \(\ell \in \{n-3, n-2, n-1, n\}\).

Let \( G \) be an edge-colored connected graph. A path \( P \) is a proper path in \( G \) if no two adjacent edges of \( P \) are colored the same. An edge coloring is a proper-path coloring of \( G \) if every pair \( u, v \) of distinct vertices of \( G \) is connected by a proper \( u-v \) path in \( G \). The minimum number of colors required for a proper-path coloring of \( G \) is the proper connection number \( \text{pc}(G) \) of \( G \). We study proper-path colorings in those graphs obtained by some well-known graph operations, namely line graphs, powers of graphs, coronas of graphs, and vertex or edge deletions. Proper connection numbers are determined for all iterated line graphs and powers of a given connected graph. For a connected graph \( G \), sharp lower and upper bounds are established for the proper connection number of (i) the \( k \)-iterated corona of \( G \) in terms of \( \text{pc}(G) \) and \( k \), and (ii) the vertex or edge deletion graphs \( G-v \) and \( G-e \), where \( v \) is a non-cut-vertex of \( G \) and \( e \) is a non-bridge of \( G \), in terms of \( \text{pc}(G) \) and the degree of \( v \). Other results and open questions are also presented.