Parity equivalence in eulerian graphs

DOI10.1002/(SICI)1097-0118(199703)24:3%3C249::AID-JGT6%3E3.0.CO;2-PMaRDI QIDQ3122899zbMATH OpenOpenAlexFDO

Authors G. Sabidussi

Publication date 16 March 1998

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199703)24:3%3C249::aid-jgt6%3E3.0.co;2-p

zbMATH Keywords

factorizationdecompositionsEulerian graphs4-connectedEulerian walkconjecture of Sylvesterparity equivalenceparity equivalentreglar graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Recharacterizing Eulerian: Intimations of new duality
• scientific article; zbMATH DE number 4061286
• On the maximum number of pairwise compatible euler cycles
• scientific article; zbMATH DE number 5016710
• scientific article; zbMATH DE number 3933111

Cited in

(5)

• Parity versions of 2-connectedness
• scientific article; zbMATH DE number 3889564 (Why is no real title available?)
• Parity theorems for paths and cycles in graphs
• scientific article; zbMATH DE number 63789 (Why is no real title available?)
• Parity, Eulerian subgraphs and the Tutte polynomial

This page was built for publication: Parity equivalence in eulerian graphs

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