A 1-Factorization of the Iterated Line Graphs of Regular Graphs

被引：0

作者：

赵光复

机构：

[1] DepartmentofAppliedMathematicsBeijingInstituteofTechnologyBeijingPRC

来源：

ChineseScienceBulletin | 1993年 / 02期

关键词：

factorization colouring; regular graph; line graph;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

<正> Which graphs are 1-factorizable? In other words, which graphs are regular graphs of class 1? It is an interesting open problem. The importance and difficulty of this problem become apparent when we realize that the four-colour theorem holds if and only if every bridgeless 3-regular planar graph is 1-factorable. Jaeger proved that if a regular graph

引用

页码：89 / 93

页数：5