Perfect pseudo-matchings in cubic graphs

DOI10.1007/s00373-024-02844-yMaRDI QIDQ6640960

Behrooz Bagheri Gh, Benedikt Klocker, Herbert Fleischner

Publication date: 20 November 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

cycle double coversnarkEulerian graphtransition systemcompatible cycle decompositionperfect pseudo-matching

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

This page was built for publication: Perfect pseudo-matchings in cubic graphs