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

detach

黑豹

有害处

自爱

Airtight

Emasculate

Programmentscheidungen (Lerneinheit VII),emicomplete digraphs with a very rich structure. The class contains digraphs, such as directed cycles, that are very far from being semicomplete. Yet a large number of classical results for semicomplete digraphs still hold for locally semicomplete digraphs. Two examples are that every connected loca

VEST

Repetitorium zur Investitionsrechnunga 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

Hiatus

https://doi.org/10.1007/978-3-8349-6316-1arcs 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

CANT

https://doi.org/10.1007/978-3-8349-6316-1on the minor relation and they have also found many algorithmic applications. Starting in the late 1990s, several ideas for generalizing this theory to digraphs have appeared. Broadly, for the purpose of this chapter, we distinguish these approaches into three categories: ., . and .. The tree-width

Isthmus