On the diameter of Eulerian orientations of graphs

DOI10.1145/1109557.1109648zbMath1192.05084OpenAlexW4238044559MaRDI QIDQ3581592

László Babai

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109648

Mathematics Subject Classification ID

Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

Bounds on the diameter of Cayley graphs of the symmetric group ⋮ Bounds for the diameters of orbital graphs of affine groups ⋮ Series-parallel orientations preserving the cycle-radius ⋮ Growth in \(\mathrm{SL}_3(\mathbb Z/p\mathbb Z)\). ⋮ On the diameter of permutation groups. ⋮ Diameter of Cayley graphs of \(\mathrm{SL}(n,p)\) with generating sets containing a transvection ⋮ Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) ⋮ Applications of character estimates to statistical problems for symmetric group ⋮ On the Query Complexity of Testing Orientations for Being Eulerian ⋮ Product decompositions of quasirandom groups and a Jordan type theorem. ⋮ Preset Distinguishing Sequences and Diameter of Transformation Semigroups ⋮ An improved diameter bound for finite simple groups of Lie type ⋮ Navigating directed Cayley graphs of small diameter: A potent Solovay–Kitaev procedure ⋮ Growth in groups: ideas and perspectives

This page was built for publication: On the diameter of Eulerian orientations of graphs