Walks through every edge exactly twice II

DOI10.1002/(SICI)1097-0118(199603)21:3%3C301::AID-JGT4%3E3.0.CO;2-UMaRDI QIDQ4875684zbMATH OpenOpenAlexFDO

Authors Jennifer Keir, R. B. Richter

Publication date 12 November 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199603)21:3%3C301::aid-jgt4%3E3.0.co;2-u

zbMATH Keywords

cocyclecyclegraphwalk

Mathematics Subject Classification ID

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

Recommendations

• Walks through every edge exactly twice
• 2-walks in circuit graphs
• scientific article; zbMATH DE number 786140
• On 2-walks in chordal planar graphs

Cited in

(6)

• Bicycles and left-right tours in locally finite graphs
• Walks through every edge exactly twice
• The transition matroid of a 4-regular graph: an introduction
• ALGEBRAIC CHARACTERIZATIONS OF GRAPH IMBEDDABILITY IN SURFACES AND PSEUDOSURFACES
• On the linear algebra of local complementation
• Circuit partitions and signed interlacement in 4-regular graphs

This page was built for publication: Walks through every edge exactly twice II

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