✦ LIBER ✦

A note on k-strongly connected orientations of an undirected graph

✍ Scribed by András Frank

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 168 KB
Volume: 39
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90044-9

No coin nor oath required. For personal study only.

✦ Synopsis

Each k-strongly connected orientation of an undirect:7d I.&P A _an be obtained from any other k-strongly connected orientation by reversing consec aLir :!I 3irected paths or circuits without destroying the k-strong connectivity.

📜 SIMILAR VOLUMES

A fully-pipelined systolic algorithm for

A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph

✍ Su-Chu Hsu; Hsien-Fen Hsieh; Shing-Tsaan Huang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 905 KB

A note on finding a shortest complete cy

A note on finding a shortest complete cycle in an undirected graph

✍ A. Volgenant; R. Jonker; G.A.P. Kindervater 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 329 KB

A Note on A Family of Directed Strongly

A Note on A Family of Directed Strongly Regular Graphs

✍ Sylvia A. Hobart; T. Justin Shaw 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 54 KB

On the non-orientable genus of a 2-conne

On the non-orientable genus of a 2-connected graph

✍ R.Bruce Richter 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 589 KB

On k-leaf connectivity of a random graph

✍ Thomasz Luczak 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB

We prove that, in a random graph with n vertices and N = cn log n edges, the subgraph generated by a set of all vertices of degree at least k + 1 is k-leaf connected for c > f . A threshold function for k-leaf connectivity is also found. ## 1. MAIN RESULTS Let G = (V(G),E(G)) be a graph, where V (

A polynomial bound on the number of ligh

A polynomial bound on the number of light cycles in an undirected graph

✍ Ashok Subramanian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 386 KB