Highly edge-connected regular graphs without large factorizable subgraphs期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

Highly edge-connected regular graphs without large factorizable subgraphs

Authors:	Davide Mattiolo Eckhard Steffen

Abstract:	We construct highly edge-connected $r$ -regular graphs of even order which do not contain $r ? 2$ pairwise disjoint perfect matchings. When $r$ is a multiple of 4, the result solves a problem of Thomassen 4].

Keywords:	factorizations perfect matchings regular graphs r-graphs