✦ LIBER ✦

On critically connected digraphs

✍ Scribed by W. Mader

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 481 KB
Volume: 13
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190130412

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On k-con-Critically n-Connected Graphs

✍ W. Mader 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We prove that every n-connected graph G of sufficiently large order contains a connected graph H on four vertices such that G À V ðH Þ is ðn À 3Þ-connected. This had been conjectured in Mader (High connectivity keeping sets in n-connected graphs, Combinatorica, to appear). Furthermore, we prove uppe

Minimum k-geodetically connected digraph

Minimum k-geodetically connected digraphs

✍ Ján Plesník 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

Connectivity of circulant digraphs

✍ Erik A. Van Doorn 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

An explicit expression is derived for the connectivity of circulant digraphs.

Weakly Hamiltonian-connected locally sem

Weakly Hamiltonian-connected locally semicomplete digraphs

✍ Bang-Jensen, J�rgen; Guo, Yubao; Volkmann, Lutz 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

We characterize weakly hamiltonian-connected locally semicomplete digraphs.

Strongly Hamiltonian-connected locally s

Strongly Hamiltonian-connected locally semicomplete digraphs

✍ Guo, Yubao 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 513 KB

We give some sufficient conditions for locally semicomplete digraphs to contain a hamiltonian path from a prescribed vertex to another prescribed vertex. As an immediate consequence of these, we obtain that every 4-connected locally semicomplete digraph is strongly hamiltonian-connected. Our results

On claw-freeM-oriented critical kernel-i

On claw-freeM-oriented critical kernel-imperfect digraphs

✍ Galeana-S�nchez, H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB

A kernel of a digraph D is an independent and dominating set of vertices of D. A chord of a directed cycle C = (0, 1 , . . . , n, 0) is an arc of D not in C with both terminal vertices in C . A diagonal of C is a chord with j # i -1. Meyniel made the conjecture (now know to be false) that if D is a