Small length circuits in Eulerian orientations of graphs

DOI10.33048/SEMI.2024.21.028MaRDI QIDQ6643531zbMATH OpenFDO

Authors A. L. Perezhogin, Igor Sergeevich Bykov, Sergey Avgustinovich

Publication date 26 November 2024

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/SEMI.2024.21.028

zbMATH Keywords

Boolean cubecircuitcomplete bipartite graphEulerian orientation of graphtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• Counting the Eulerian orientations of one class of circulant graphs
• Eulerian Orientations and Circulations
• Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs
• On the number of Eulerian orientations of a graph
• Graphs for which all strong orientations are Eulerian

This page was built for publication: Small length circuits in Eulerian orientations of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6643531)