Search

Let $D$ be a digraph. A stable set $S$ of $D$ and a path partition $\mathcal{P}$ of $D$ are orthogonal if every path $P \in \mathcal{P}$ contains exactly one vertex of $S$. In 1982, Berge defined the class of $\alpha$-diperfect digraphs. A digraph $D$ is $\alpha$-diperfect if for every maximum stable set $S$ of $D$ there is a path partition $\mathcal{P}$ of $D$ orthogonal to $S$ and this property holds for every induced subdigraph of $D$. An anti-directed odd cycle is an orientation of an odd cycle $(x_0,\ldots,x_{2k},x_0)$ with $k\geq2$ in which each vertex $x_0,x_1,x_2,x_3,x_5,x_7\ldots,x_{2k-1}$ is either a source or a sink. Berge conjectured that a digraph $D$ is $\alpha$-diperfect if and only if $D$ does not contain an anti-directed odd cycle as an induced subdigraph. In this paper, we show that this conjecture is false by exhibiting an infinite family of orientations of complements of odd cycles with at least seven vertices that are not $\alpha$-diperfect.

Let $D$ be a digraph. Given a set of vertices $S \subseteq V(D)$, an $S$-path partition $\mathcal{P}$ of $D$ is a collection of paths of $D$ such that $\{V(P) \colon P \in \mathcal{P}\}$ is a partition of $V(D)$ and $|V(P) \cap S| = 1$ for every $P \in \mathcal{P}$. We say that $D$ satisfies the $\alpha$-property if, for every maximum stable set $S$ of $D$, there exists an $S$-path partition of $D$, and we say that $D$ is $\alpha$-diperfect if every induced subdigraph of $D$ satisfies the $\alpha$-property. A digraph $C$ is an anti-directed odd cycle if (i) the underlying graph of $C$ is a cycle $x_1x_2 \cdots x_{2k + 1}x_1$, where $k \in \mathbb{Z}$ and $k \geq 2$, and (ii) each of the vertices $x_1, x_2, x_3, x_4, x_6,$ $x_8, \ldots, x_{2k}$ is either a source or a sink. Berge (1982) conjectured that a digraph is $\alpha$-diperfect if, and only if, it contains no induced anti-directed odd cycle. Remark that this conjecture is strikingly similar to Berge's conjecture on perfect graphs -- nowadays known as the Strong Perfect Graph Theorem (Chudnovsky, Robertson, Seymour, and Thomas, 2006). To the best of our knowledge, Berge's conjecture for $\alpha$-diperfect digraphs has been verified only for symmetric digraphs and digraphs whose underlying graph are perfect. In this paper, we verify it for digraphs whose underlying graphs are series-parallel and for in-semicomplete digraphs. Moreover, we propose a conjecture similar to Berge's and verify it for all the known cases of Berge's conjecture.

We show in this paper that a split-comparability graph $G$ has chromatic index equal to $\Delta(G) + 1$ if and only if $G$ is neighborhood-overfull. That implies the validity of the Overfull Conjecture for the class of split-comparability graphs.

Let $k$ be a positive integer and let $D$ be a digraph. A path partition $\sP$ of $D$ is a set of vertex-disjoint paths which covers $V(D)$. Its $k$-norm is defined as $\sum_{P \in \sP} \Min{|V(P)|, k}$. A path partition is $k$-optimal if its $k$-norm is minimum among all path partitions of $D$. A partial $k$-coloring is a collection of $k$ disjoint stable sets. A partial $k$-coloring $\sC$ is orthogonal to a path partition $\sP$ if each path $P \in \sP$ meets $\min\{|P|,k\}$ distinct sets of $\sC$. Berge (1982) conjectured that every $k$-optimal path partition of $D$ has a partial $k$-coloring orthogonal to it. A (path) $k$-pack of $D$ is a collection of at most $k$ vertex-disjoint paths in $D$. Its weight is the number of vertices it covers. A $k$-pack is optimal if its weight is maximum among all $k$-packs of $D$. A coloring of $D$ is a partition of $V(D)$ into stable sets. A $k$-pack $\sP$ is orthogonal to a coloring $\sC$ if each set $C \in \sC$ meets $\Min{|C|, k}$ paths of $\sP$. Aharoni, Hartman and Hoffman (1985) conjectured that every optimal $k$-pack of $D$ has a coloring orthogonal to it. A digraph $D$ is semicomplete if every pair of distinct vertices of $D$ is adjacent. A digraph $D$ is locally in-semicomplete if, for every vertex $v \in V(D)$, the in-neighborhood of $v$ induces a semicomplete digraph. Locally out-semicomplete digraphs are defined similarly. In this paper, we prove Berge's and Aharoni-Hartman-Hoffman's Conjectures for locally in/out-semicomplete digraphs.

Let $G=(V,E)$ be an $n$-vertex graph with $m$ edges. A function $f : V \cup E \rightarrow \{1, \ldots, n+m\}$ is an edge-magic labeling of $G$ if $f$ is bijective and, for some integer $k$, we have $f(u)+f(v)+f(uv) = k$ for every edge $uv \in E$. Furthermore, if $f(V) = \{1, \ldots, n\}$, then we say that $f$ is a super edge-magic labeling. A constellation, which is a collection of stars, is symmetric if the number of stars of each size is even except for at most one size. We prove that every symmetric constellation with an odd number of stars admits a super edge-magic labeling. We say that a caterpillar is of type $(r,s)$ if $r$ and $s$ are the sizes of its parts, where $r \leq s$. We also prove that every collection with an odd number of same-type caterpillars admits an edge-magic labeling.

In this paper we introduce a superclass of split digraphs, which we call spine digraphs. Those are the digraphs D whose vertex set can be partitioned into two sets X and Y such that the subdigraph induced by X is traceable and Y is a stable set. We also show that Linial's Conjecture holds for spine digraphs.