… A bigraph is called restricted unimodular, or RU, if all its cycles are quad, that is to say, their
… are those chordal graphs whose vk graph is RU, and we call them RU chordal graphs. We …

… a chordal graph G is gem- and crown-free if and only if V K(G) is 3-chorded. A restricted
unimodular (RU) chordal graph is a chordal graph … unimodular. Peled and Wu [8] showed that a …

… This section focuses on using linear and integer linear programming for totally
unimodular matrices to solve the k-tuple domination problem for weighted proper interval …

… radius of chordal graphs. Efficient algorithms for both problems on sun-free chordal graphs
are … However, condition (P2) is unnecessarily restrictive since we only require Gk to beperfect …

… If D is a masa, then the elements of ND(A) are closely tied to matrix units; precisely, they are
sums of unimodular multiples of … Then, after possibly restricting to subsystems, we obtain a …

… chordal graphs. … unimodular we apply Theorem 4.3. Let B be a submatrix of A. If B does not
contain a subrow of row w of A the result is obvious. Let B i be the submatrix of B restricted to […

… OCCP problem restricted to bipartite, chordal, comparability, … the approximability of OCCP
restricted to interval graphs. We … time for interval and even for unimodular graphs. This implies …

… for the OCCP problem restricted to bipartite and interval graphs, … [V[ ~ for both graph classes
and for unimodular graphs. Finally, … restricted to split, chordal, permutation and comparability …

… One example is the family of interval graphs: these have O ( n ) minimal nontrivial cutsets,
which can be generated efficiently. But all chordal graphs have O ( n ) minimal cutsets, and …

… then K is totally unimodular so that the extreme points of ( x… graph G is chordal, then every
cycle of G of length greater than 3 has a chord [9]. It is easy to see that a tree is a chordal graph…