Perfect Pseudo-Matchings in cubic graphs
Combinatorics
2019-05-14 v1
Abstract
A perfect pseudo-matching M in a cubic graph G is a spanning subgraph of G such that every component of M is isomorphic to K_2 or to K_1,3. In view of snarks G with dominating cycle C, this is a natural generalization of perfect matchings since G-E(C) is a perfect pseudo-matching. Of special interest are such M where the graph G/M is planar because such G have a cycle double cover. We show that various well known classes of snarks contain planarizing perfect pseudo-matchings, and that there are at least as many snarks with planarizing perfect pseudo-matchings as there are cyclically 5-edge-connected snarks.
Keywords
Cite
@article{arxiv.1905.04551,
title = {Perfect Pseudo-Matchings in cubic graphs},
author = {Herbert Fleischner and Behrooz Bagheri Gh. and Benedikt Klocker},
journal= {arXiv preprint arXiv:1905.04551},
year = {2019}
}
Comments
20 pages, 8 figures, 1 table