Titlebook: Classes of Directed Graphs; J?rgen Bang-Jensen,Gregory Gutin Book 2018 Springer International Publishing AG, part of Springer Nature 2018

要塞

Restenosis

AMEND

aquatic

Acyclic Digraphs,pplications. We consider some basic results on acyclic digraphs and introduce transitive digraphs, and the transitive closure and transitive reduction of a digraph. We discuss results on out- and in-branchings, the .-linkage problem, maximum dicuts, and the multicut problem. We present enumeration r

不適當(dāng)

Fecal-Impaction

Planar Digraphs,crossings. The main goal of this chapter is to show, from multiple angles, how the planarity assumption imposes structure on digraphs and how such structure, in conjunction with topological arguments, can be used algorithmically.

Suppository

積習(xí)已深

Semicomplete Multipartite Digraphs,a complete multipartite graph by replacing every edge by an arc or a pair of opposite arcs. In other words, the vertex set of a semicomplete multipartite digraph can be partitioned into sets such that vertices within the same set are nonadjacent and vertices between different sets are adjacent. This

entail

Quasi-Transitive Digraphs and Their Extensions,arcs of .. Quasi-transitive digraphs generalize both tournaments (and semicomplete digraphs) and transitive digraphs, and share some of the nice properties of these families. In particular, many problems that are .-complete for general digraphs become solvable in polynomial time when restricted to q

fledged