A graph is \((k, l)\)-colorable if its vertex set can be partitioned into \( k \) independent sets and \( l \) cliques. A graph is chordal if it does not contain any induced cycle of length at least four. A theorem by Hell et al. states that a chordal graph is \((k, l)\)-colorable if and only if it does not contain \((l+1)K_{k+1}\) as an induced subgraph. Presented here is a short alternative proof of this result, using the characterization of chordal graphs via perfect elimination orderings.

A subset \( X \) of the vertex set of a graph \( G \) is a secure dominating set of \( G \) if \( X \) is a dominating set of \( G \) and if, for each vertex \( u \) not in \( X \), there is a neighboring vertex \( v \) of \( u \) in \( X \) such that the swap set \( (X – \{v\}) \cup \{u\} \) is again a dominating set of \( G \). The secure domination number of \( G \), denoted by \( \gamma_s(G) \), is the cardinality of a smallest secure dominating set of \( G \). In this paper, we present two algorithms (a branch-and-reduce algorithm as well as a branch-and-bound algorithm) for determining the secure domination number of a general graph \( G \) of order \( n \). The worst-case time complexities of both algorithms are \( \mathcal{O}(2^{n-s-\sum_{i=1}^{k}(|\mathcal{R}_i|-1)}) \), where \( s \) is the number of support vertices in \( G \) and \( \mathcal{R}_i, \ldots, \mathcal{R}_k \) are the redundancy classes of \( G \) (two vertices are in the same redundancy class if they are adjacent and share the same closed neighborhood which forms a clique in \( G \)).

The distinguishing chromatic number of a graph \( G \) is the least integer, \( \chi_D(G) \), for which \( G \) has a coloring of its vertices so that adjacent vertices receive different colors, and the identity is the only automorphism of \( G \) that preserves vertex colors. Our focus is on determining the distinguishing chromatic numbers of wreath products of graphs, extending the work of Tang. We prove that if \( C_n \) is a cycle with \( n \) vertices and \( P_n \) is a path with \( n \) vertices, then \( \chi_D(C_n[G]) \) and \( \chi_D(P_n[G]) \) can be found for any connected graph \( G \). We also obtain an upper bound on \( \chi_D(T[G]) \) when \( T \) is a tree and \( G \) is any connected graph. Some of our results depend on the notion of inequivalent colorings. Cheng introduces inequivalent colorings and provides a formula for computing the number of inequivalent distinguishing \( k \)-colorings of a rooted tree. We add to this work by obtaining an expression for computing the number of inequivalent distinguishing \( k \)-colorings of a cycle.

A graph \( G \) is said to be well-covered if every maximal independent set of vertices has the same cardinality. A planar (simple) graph in which each face is a quadrilateral is called a (planar) quadrangulation. In the present paper, we characterize those planar quadrangulations which are well-covered.

Suppose \( V \) is a finite set and \( \mathcal{C} \) a collection of subsets of \( V \) that contains \( \emptyset \) and \( V \) and is closed under taking intersections. Then the ordered pair \( (V, \mathcal{C}) \) is called a \({convexity}\) and the elements of \( \mathcal{C} \) are referred to as \({convex\; sets}\). For a set \( S \subseteq V \), the \({convex\; hull}\) of \( S \) relative to \( \mathcal{C} \), denoted by \( CH_{\mathcal{C}}(S) \), is the smallest convex set containing \( S \). The \({Carathéodory\; number}\), relative to a given convexity, is the smallest integer \( c \) such that for any subset \( S \) of \( V \) and any point \( v \in CH_{\mathcal{C}}(S) \), there is a subset \( F \) of \( S \) with \( |F| \leq c \) such that \( v \in CH_{\mathcal{C}}(F) \). A subset \( X \) of \( V \) is said to admit a \({Radon \;partition}\) if \( X \) can be partitioned into two sets \( X_1 \) and \( X_2 \) such that \( CH_{\mathcal{C}}(X_1) \cap CH_{\mathcal{C}}(X_2) \neq \emptyset \). The \({Radon\; number}\) of a convexity is the smallest integer \( r \) (if it exists) such that every subset \( X \) of \( V \) with at least \( r \) elements admits a Radon partition.

A set \( S \) of vertices in a graph \( G \) with vertex set \( V \) is \({digitally}\) convex if for every vertex \( v \in V \), \( N[v] \subseteq N[S] \) implies \( v \in S \). A set \( X \) is \({irredundant}\) if \( N[X] – N[X – \{x\}] \neq \emptyset \) for all \( x \in X \). The maximum cardinality of an irredundant set is the \({upper\; irredundance\; number}\) of \( G \), denoted by \( IR(G) \). A set \( X \) of vertices in a graph \( G \) is a \({local\; irredundant}\) set for a vertex \( v \) of \( G \), if for each \( x \in X \), \( x \in N[v] – N[X – \{x\}] \) or \( x \) is adjacent to a vertex of \( N[v] – N[X – \{x\}] \). The \({upper\; local \;irredundance \;number}\) of \( v \), denoted by \( l_{IR}(v) \), is the maximum cardinality of a local irredundant set for \( v \). The \({upper\; local\; irredundance\; number}\) of a graph \( G \), denoted by \( l_{IR}(G) \), is defined as \( l_{IR}(G) = \max \{ l_{IR}(v) \mid v \in V \} \).

We show that for the digital convexity of a graph \( G \):
(i) The Carathéodory number equals \( l_{IR}(G) \).
(ii) The Radon number is bounded above by \( IR(G) + 1 \) and below by \( \beta(G) + 1 \) where \( \beta(G) \) is the independence number of \( G \). For the latter result, it is shown that there are classes of graphs for which the lower (respectively, upper) bound is attained, while the difference between the upper irredundance number and the independence number can be made as large as we wish. Moreover, there are graphs for which the Radon number of the digital convexity lies strictly between the bounds given in (ii) and does not equal one more than the upper domination number.

In this work, we study the structure of the null spaces of matrices associated with graphs. Our primary tool is utilizing Schur complements based on certain collections of independent vertices. This idea is applied in the case of trees, and seems to represent a unifying theory within the context of the support of the null space. We extend this idea and apply it to describe the null vectors and corresponding nullities of certain symmetric matrices associated with cycles.

A set of vertices in a graph \( G \) is a global dominating set of \( G \) if it dominates both \( G \) and its complement \( \overline{G} \). The minimum cardinality of a global dominating set of \( G \) is the global domination number of \( G \). We explore the effects of graph modifications (edge removal, vertex removal, and edge addition) on the global domination number. In particular, for each graph modification, we study the global domination stable trees, that is, the trees whose global domination number remains the same upon the modification. We characterize these stable trees having small global domination numbers.

A digraph is called \({homogeneous}\) if every connected induced sub-digraph with two or more vertices is either strong or acyclic. The class of homogeneous digraphs contains acyclic digraphs, round digraphs, and symmetric digraphs. Tournaments which are homogeneous have been studied by Guido, Moon, and others, and characterized by Moon. In this paper, we give a characterization of homogeneous digraphs. Our characterization reveals a nice structural property of this class of digraphs and shows that all homogeneous digraphs can be obtained from acyclic digraphs, round digraphs, and symmetric digraphs by the operation of substitution.

We analyze TIMBER, a game played on graphs. We find the \(\mathcal{P}\) positions for both normal and misère play on paths and show how to win the game. In passing, we also show a correspondence with Dyck paths, the Catalan, and Fine numbers. We present an algorithm for winning the Normal Play game on trees.

An edge ordering of a graph \( G \) is an injection \( f : E(G) \to \mathbb{Z} \), where \( \mathbb{Z} \) denotes the set of integers. A path in \( G \) for which the edge ordering \( f \) increases along its edge sequence is called an \( f \)-\({ascent}\); an \( f \)-ascent is maximal if it is not contained in a longer \( f \)-ascent. The \({depression}\) of \( G \) is the smallest integer \( k \) such that any edge ordering \( f \) has a maximal \( f \)-ascent of length at most \( k \). We apply the concept of ascents to edge colorings using possibly less than \( |E(G)| \) colors and consider the problem of determining the minimum number of colors required such that there exists an edge coloring \( c \) for which the length of a shortest maximal \( c \)-ascent is equal to the depression of \( G \).