✦ LIBER ✦

-kernels in -transitive and -quasi-transitive digraphs

✍ Scribed by César Hernández-Cruz; Hortensia Galeana-Sánchez

Book ID: 113567693
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 248 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.05.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Kings in quasi-transitive digraphs

✍ J∅rgen Bang-Jensen; Jing Huang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 505 KB

Vertex heaviest paths and cycles in quas

Vertex heaviest paths and cycles in quasi-transitive digraphs

✍ Jørgen Bang-Jensen; Gregory Gutin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 381 KB

A digraph D is called a quasi-transitive digraph (QTD) if for any triple x,y,z of distinct vertices of D such that (x,y) and (y,z) are arcs of D there is at least one at': from x to z or from z to x. Solving a conjecture by Bangdensen and Huang (1995), Gutin (1995) described polynomial algorithms fo

On the structure of strong 3-quasi-trans

On the structure of strong 3-quasi-transitive digraphs

✍ Hortensia Galeana-Sánchez; Ilan A. Goldfeder; Isabel Urrutia 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 262 KB

Finding cheapest cycles in vertex-weight

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs

✍ Jørgen Bang-Jensen; Gregory Gutin; Anders Yeo 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 244 KB

Arc transitive covering digraphs and the

Arc transitive covering digraphs and their eigenvalues

✍ L. Babai 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 352 KB

Disjoint quasi-kernels in digraphs

✍ Scott Heard; Jing Huang 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

## Abstract A __quasi‐kernel__ in a digraph is an independent set of vertices such that any vertex in the digraph can reach some vertex in the set via a directed path of length at most two. Chvátal and Lovász proved that every digraph has a quasi‐kernel. Recently, Gutin et al. raised the question o