Academic Journal

Two-connected orientations of Eulerian graphs

التفاصيل البيبلوغرافية
العنوان: Two-connected orientations of Eulerian graphs
المؤلفون: Alex R. Berg, Tibor Jordán
المساهمون: The Pennsylvania State University CiteSeerX Archives
المصدر: http://www.cs.elte.hu/egres/design/generated/././tr/egres-04-03pdf.pdf.
سنة النشر: 2004
المجموعة: CiteSeerX
الوصف: 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 \in V . We prove that every weakly four-connected Eulerian graph has a 2-connected Eulerian orientation. This verifies a special case of a conjecture of A. Frank.
نوع الوثيقة: text
وصف الملف: application/pdf
اللغة: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.9265; http://www.cs.elte.hu/egres/design/generated/././tr/egres-04-03pdf.pdf
الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.9265
http://www.cs.elte.hu/egres/design/generated/././tr/egres-04-03pdf.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
رقم الانضمام: edsbas.988F82DF
قاعدة البيانات: BASE