论文信息 - Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus

Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus

Anton Kotzig has shown that every connected 4-regular plane graph has an A-trail, that is an Euler trail in which any two consecutive edges lie on a common face boundary. We shall characterise the 4-regular plane graphs which contain twoorthogonalA-trails, that is to say two A-trails for which no subtrail of length 2 appears in both A-trails. Our proof gives rise to a polynomial algorithm for deciding if two such A-trails exists. We shall also discuss the corresponding problem for graphs in the projective plane and the torus, and the related problem of deciding when a 2-regular digraph contains two orthogonal Euler trails.

[1] André Bouchet,et al. Matchings and -matroids , 1989, Discret. Appl. Math..

[2] R. Bruce Richter. Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces , 1991, Discret. Math..

[3] R. Bruce Richter,et al. Trees and Euler tours in a planar graph and its relatives , 1987 .

[4] Lars Døvling Andersen,et al. The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs , 1995, Discret. Appl. Math..

[5] Bill Jackson,et al. A characterisation of graphs having three pairwise compatible Euler tours , 1991, J. Comb. Theory, Ser. B.

[6] Udi Manber,et al. On non-intersecting Eulerian circuits , 1987, Discret. Appl. Math..

[7] W. T. Tutte. On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[8] André Bouchet,et al. Maps and Delta-matroids , 1989, Discret. Math..

[9] C. Nash-Williams. Decomposition of Finite Graphs Into Forests , 1964 .

[10] H. Fleischner. Eulerian graphs and related topics , 1990 .

[11] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .

[12] Bill Jackson. Supplementary Eulerian vectors in isotropic systems , 1991, J. Comb. Theory, Ser. B.