๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Strongly connected orientations of plane graphs

โœ Scribed by Evangelos Kranakis; Oscar Morales; Ladislav Stacho

Book ID
119225051
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
247 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Cell rotation graphs of strongly connect
Cell rotation graphs of strongly connected orientations of plane graphs with an application
โœ Heping Zhang; Peter Che Bor Lam; Wai Chee Shiu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 345 KB

The cell rotation graph D(G) on the strongly connected orientations of a 2-edge-connected plane graph G is deรฟned. It is shown that D(G) is a directed forest and every component is an in-tree with one root; if T is a component of D(G), the reversions of all orientations in T induce a component of D(

Two-connected orientations of Eulerian g
Two-connected orientations of Eulerian graphs
โœ Alex R. Berg; Tibor Jordรกn ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 116 KB

## Abstract A graph __G__ = (__V__, __E__) is said to be weakly fourโ€connected if __G__ is 4โ€edgeโ€connected and __G__ โ€“ __x__ is 2โ€edgeโ€connected for every __x__ โˆˆ __V__. We prove that every weakly fourโ€connected Eulerian graph has a 2โ€connected Eulerian orientation. This verifies a special case of

A note on k-strongly connected orientati
A note on k-strongly connected orientations of an undirected graph
โœ Andrรกs Frank ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 168 KB

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.