✦ LIBER ✦

Bounding the feedback vertex number of digraphs in terms of vertex degrees

✍ Scribed by Hermann Gruber

Book ID: 108112917
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 189 KB
Volume: 159
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.01.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounding the vertex cover number of a hy

Bounding the vertex cover number of a hypergraph

✍ Guo-Li Ding; Paul Seymour; Peter Winkler 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 539 KB

Arc-chromatic number of digraphs in whic

Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree

✍ S. Bessy; F. Havet; E. Birmelé 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB

## Abstract A __k__‐__digraph__ is a digraph in which every vertex has outdegree at most __k__. A $(k \vee l)$‐__digraph__ is a digraph in which a vertex has either outdegree at most __k__ or indegree at most __l__. Motivated by function theory, we study the maximum value Φ (__k__) (resp. $\Phi^{\v

Bounding the size of a vertex-stabiliser

Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph

✍ Cheryl E. Praeger; Pablo Spiga; Gabriel Verret 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Bounds on the vertex–edge domination num

Bounds on the vertex–edge domination number of a tree

✍ Krishnakumari, Balakrishna; Venkatakrishnan, Yanamandram B.; Krzywkowski, Marcin 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 201 KB

On the Band-, Tree-, and Clique-Width of

On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree

✍ Lozin, V.; Rautenbach, D. 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 178 KB

Problem of computing the expected maximu

Problem of computing the expected maximum number of vertex-disjoint s-t paths on probabilistic digraphs

✍ Peng Cheng; Shigeru Masuyama 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 686 KB