Pages that link to "Item:Q3478428"
From MaRDI portal
The following pages link to On the maximum number of pairwise compatible euler cycles (Q3478428):
Displaying 15 items.
- Compatible path-cycle-decompositions of plane graphs (Q1084113) (← links)
- A characterisation of graphs having three pariwise compatible Euler tours (Q1264154) (← links)
- Euler cycles in \(K_{2m}\) plus perfect matching (Q1289075) (← links)
- Compatible Euler tours and supplementary Eulerian vectors (Q1321675) (← links)
- Compatible Euler tours of \(K_n^{**}\) (Q1392580) (← links)
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems (Q1752690) (← links)
- Euler tours of maximum girth in \(K_{2n+1}\) and \(K_{2n,2n}\) (Q1777229) (← links)
- Compatible Eulerian circuits in \(K_ n^{**}\) (Q1842648) (← links)
- Embedding digraphs on orientable surfaces (Q1850600) (← links)
- Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs (Q2687939) (← links)
- Parity equivalence in eulerian graphs (Q3122899) (← links)
- Cycles containing matchings and pairwise compatible euler tours (Q4206766) (← links)
- On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions (Q4614042) (← links)
- Covering 2-paths uniformly (Q4948740) (← links)
- Eulerian straight ahead cycles in drawings of complete bipartite graphs (Q5931408) (← links)