Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus

Journal of Combinatorial Theory. Series B

Volumn 66, Issue 2, 1996, Pages 232-246

  Andersen, Lars DØvling ^a   Bouchet, André ^b   Jackson, Bill ^c  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITÉ DU MAINE   (France)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030101216     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1996.0017     Document Type: Article

References (17)

1. 1. L. D. ANDERSEN AND H. FLEISCHNER, The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs, Discrete Appl. Math. 59 (1995), 203-214.
2. 2. S. W. BENT AND U. MANBER, On non-intersecting Eulerian circuits, Discrete Appl. Math. 18 (1987), 87-94.
3. 3. A. BOUCHET, Maps and Δ-matroids, Discrete Math. 78 (1989), 59-71.
4. 4. A. BOUCHET, Matchings and Δ-matroids, Discrete Appl. Math. 24 (1989), 55-62.
5. 5. J. EDMONDS, Matroid partition, in "Mathematics of the Decision Sciences," Lectures in Applied Mathematics, Vol. 11, pp. 335-346, Amer. Math. Soc., Providence, RI, 1967.
6. 6. J. EDMONDS, Submodular functions, matroids and certain polyhedra, in "Combinatorial Structures and Their Applications" (R. Guy, H. Hanani, N. Sauer, and J. Schönheim, Eds.), pp. 69-87, Gordon & Breach, New York, 1970.
7. 7. H. FLEISCHNER, "Eulerian Graphs and Related Topics," Part I, Vols. 1 and 2, North-Holland, Amsterdam, 1990-1991.
8. 8. B. JACKSON, A characterisation of graphs having three pairwise compatible Euler tours, J. Combin. Theory Ser. B 53 (1991), 80-92.
9. 9. B. JACKSON, Supplementary Eulerian vectors in isotropic systems, J. Combin. Theory Ser. B 53 (1991), 93-105.
10. 10. M. E. KIDWELL AND R. B. RICHTER, Trees and Euler tours in a planar graph and its relatives, Amer. Math. Monthly 94 (1987), 618-630.
11. 11. A. KOTZIG, Eulerian lines in finite 4-valent graphs and their transformations, in "Theory of Graphs" (P. Erdos and G. Katona, Eds.), pp. 219-230, Academic Press, New York, 1968.
12. 12. M. LAS VERGNAS, Eulerian circuits of 4-valent graphs imbedded in surfaces, in "Algebraic Methods in Graph Theory, Colloquia Mathematica Societatis János Bolyai 25, Szeged, Hungary, 1978," pp. 451-477.
13. 13. C. ST. J. A. NASH-WILLIAMS, Edge-disjoint spanning trees of finite graphs, J. London Math. Soc. 36 (1961), 445-450.
14. 14. C. ST. J. A. NASH-WILLIAMS, Decomposition of finite graphs into forests, J. London Math. Soc. 39 (1964), 12.
15. 15. R. B. RICHTER, Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces, Discrete Math. 89 (1991), 261-268.
16. 16. É. TARDOS, Generalized matroids and supermodular colourings, in "Matroid Theory, Colloquia Mathematica Societatis János Bolyai 40" (A. Recski and L. Lovász, Eds.), pp. 359-382, North-Holland, Amsterdam/New York, 1985.
17. 17. W. T. TUTTE, On the problem of decomposing a graph into n connected factors, J. London Math. Soc. 36 (1961), 221-230.