Parity equivalence in eulerian graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199703)24:3<249::AID-JGT6>3.0.CO;2-P" /><249::AID-JGT6>3.0.CO;2-P 10.1002/(SICI)1097-0118(199703)24:3<249::AID-JGT6>3.0.CO;2-PzbMath0883.05094OpenAlexW4236144621MaRDI QIDQ3122899

Gert Sabidussi

Publication date: 16 March 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199703)24:3<249::aid-jgt6>3.0.co;2-p

zbMATH Keywords

decompositionsfactorizationEulerian graphs4-connectedEulerian walkconjecture of Sylvesterparity equivalenceparity equivalentreglar graph

Mathematics Subject Classification ID

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

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