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

counterfeit

書目名稱Classes of Directed Graphs影響因子(影響力)




書目名稱Classes of Directed Graphs影響因子(影響力)學(xué)科排名




書目名稱Classes of Directed Graphs網(wǎng)絡(luò)公開度




書目名稱Classes of Directed Graphs網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Classes of Directed Graphs被引頻次




書目名稱Classes of Directed Graphs被引頻次學(xué)科排名




書目名稱Classes of Directed Graphs年度引用




書目名稱Classes of Directed Graphs年度引用學(xué)科排名




書目名稱Classes of Directed Graphs讀者反饋




書目名稱Classes of Directed Graphs讀者反饋學(xué)科排名

debouch

Programmentscheidungen (Lerneinheit VII),ious important proof-techniques. Several of the results hold even for some superclasses of locally semicomplete digraphs. Many of the proofs and algorithms rely on a structural characterization of those locally semicomplete digraphs that are not semicomplete (have independence number at least 2). As

CHYME

https://doi.org/10.1007/978-3-8349-6316-1. to be .-quasi-transitive if for any pair of vertices .,?. in ., the existence of a path of length . from . to . implies that ., . or both are arcs of .. Given a class of digraphs ., we say that a digraph is totally .-decomposable if it can be expressed as a composition of totally .-decomposable di

SKIFF

https://doi.org/10.1007/978-3-8349-6316-1gue of tree-width measure global connectivity in digraphs. However, on digraphs, connectivity can be measured in many different natural ways. It turns out that equivalent characterizations of tree-width on undirected graphs yield different concepts on digraphs, with different properties, advantages

Rebate

https://doi.org/10.1007/978-3-8349-3824-4t digraphs which are mentioned in several results throughout the book and appear in this chapter in a section mainly dedicated to perfect digraphs, game-perfect digraphs and weakly game-perfect digraphs. Furthermore, we consider some digraph classes that appear naturally in applications to other fie

增減字母法

Locally Semicomplete Digraphs and Generalizations,ious important proof-techniques. Several of the results hold even for some superclasses of locally semicomplete digraphs. Many of the proofs and algorithms rely on a structural characterization of those locally semicomplete digraphs that are not semicomplete (have independence number at least 2). As

增減字母法

Quasi-Transitive Digraphs and Their Extensions,. to be .-quasi-transitive if for any pair of vertices .,?. in ., the existence of a path of length . from . to . implies that ., . or both are arcs of .. Given a class of digraphs ., we say that a digraph is totally .-decomposable if it can be expressed as a composition of totally .-decomposable di

愛哭

受人支配

Miscellaneous Digraph Classes,t digraphs which are mentioned in several results throughout the book and appear in this chapter in a section mainly dedicated to perfect digraphs, game-perfect digraphs and weakly game-perfect digraphs. Furthermore, we consider some digraph classes that appear naturally in applications to other fie

頂點(diǎn)