✦ LIBER ✦

Testing Eulerianity and connectivity in directed sparse graphs

✍ Scribed by Yaron Orenstein; Dana Ron

Book ID: 113927477
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 394 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.06.038

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distribution-Free Connectivity Testing f

Distribution-Free Connectivity Testing for Sparse Graphs

✍ Shirley Halevy; Eyal Kushilevitz 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 487 KB

Counting strongly-connected, moderately

Counting strongly-connected, moderately sparse directed graphs

✍ Boris Pittel 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB

Algebraic connectivity of directed graph

Algebraic connectivity of directed graphs

✍ Wu, Chai Wah 📂 Article 📅 2005 🏛 Taylor and Francis Group 🌐 English ⚖ 210 KB

Determining uni-connectivity in directed

Determining uni-connectivity in directed graphs

✍ Adam L. Buchsbaum; Martin C. Carlisle 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 328 KB

Eulerian subgraphs in 3-edge-connected g

Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs

✍ Zhi-Hong Chen; Hong-Jian Lai; Xiangwen Li; Deying Li; Jinzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract In this paper, we show that if __G__ is a 3‐edge‐connected graph with $S \subseteq V(G)$ and $|S| \le 12$, then either __G__ has an Eulerian subgraph __H__ such that $S \subseteq V(H)$, or __G__ can be contracted to the Petersen graph in such a way that the preimage of each vertex of th

Sparse certificates and removable cycles

Sparse certificates and removable cycles in -mixed -connected graphs

✍ Alex R. Berg; Tibor Jordán 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 165 KB