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

DOI10.1070/SM2011V202N09ABEH004188zbMATH Open1237.05114OpenAlexW1995968198MaRDI QIDQ3225577FDOQ3225577

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

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

zbMATH Keywords

adjacency matrixEuler tourframed 4-graphsGauss circuitrotating circuit

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• A parity map of framed chord diagrams
• Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices
• Graph-links: nonrealizability, orientation, and Jones polynomial
• Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs
• On realizability of Gauss diagrams and constructions of meanders
• Parity conditions for realizability of Gauss diagrams
• Multistring based matrices

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)