A lambda in a graph G is two edges uv and vw such that uw is not an edge. A subgraph A of G is called a lambda-subgraph if every lambda of G has both or neither of its edges in A. We describe theâ€¦ (More)

An induced matching in a graph G is a set of edges, no two of which meet a common node or are joined by an edge of G; that is, an induced matching is a matching which forms an induced subgraph.â€¦ (More)

We consider the problem of partitioning the vertex-set of a graph into at most k parts A1, A2,..., Ak, where it may be specified that Ai induce a stable set, a clique, or an arbitrary subgraph, andâ€¦ (More)

An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central role in a classicalâ€¦ (More)

Cameron, K. and J. Edmonds, Coflow polyhedra, Discrete Mathematics 101 (1992) 1-21. A system L of linear inequalities in the variables x is called totally dual integral (TDI) if for every linearâ€¦ (More)

Kobler andRotics gaveapolytimealgorithm for deciding if a graphhasmaximum inducedmatching andmaximummatching the same size, and for finding amaximum inducedmatching in a graphwhere equality holds. Weâ€¦ (More)