Eulerian straight ahead cycles in drawings of complete bipartite graphs

DOI10.1016/S0012-365X(00)00068-6zbMATH Open0984.05026OpenAlexW1973813076WikidataQ127972398 ScholiaQ127972398MaRDI QIDQ5931408

Heiko Harborth

Publication date: 2 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00068-6

zbMATH Keywords

cycle decompositionsdrawingEulerian graphsEulerian straight ahead trailEulerian trails

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Euler cycles in the complete graph \(K_{2m+1}\)

This page was built for publication: Eulerian straight ahead cycles in drawings of complete bipartite graphs

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