Framed 4-graphs: Euler tours, Gauss circuits and rotating circuits

DOI10.1070/SM2011V202N09ABEH004188MaRDI QIDQ3225577zbMATH OpenOpenAlexFDO

Authors D. P. Ilyutko

Publication date 22 March 2012

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

Full work available at URL https://doi.org/10.1070/sm2011v202n09abeh004188

zbMATH Keywords

adjacency matrixEuler tourframed 4-graphsGauss circuitrotating circuit

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• scientific article; zbMATH DE number 4010556
• The Gauss code problem off the plane
• Compatible Euler tours and supplementary Eulerian vectors
• scientific article; zbMATH DE number 3873369
• Recharacterizing Eulerian: Intimations of new duality

Cited in

(10)

• Graph-links: nonrealizability, orientation, and Jones polynomial
• On realizability of Gauss diagrams and constructions of meanders
• A parity map of framed chord diagrams
• scientific article; zbMATH DE number 4010556 (Why is no real title available?)
• Parity conditions for realizability of Gauss diagrams
• Multistring based matrices
• Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices
• Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs
• Linking number for graph-links and some classification of graph-links
• The cycle space of the graph of circles for a resolution of a generalized cross graph

This page was built for publication: Framed 4-graphs: Euler tours, Gauss circuits and rotating circuits

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