论文信息 - Class one graphs

Class one graphs

Abstract Conditions on the subgraph induced by the vertices of maximum degree of a simple graph G are found which are sufficient for G to be class 1. These conditions can be used to generalize a result of Fournier. An efficient algorithm is described for deciding whether or not a particular graph satisfies the conditions.

Dean G. Hoffman | Christopher A. Rodger | C. Rodger | D. Hoffman

[1] Anthony J. W. Hilton,et al. The chromatic index of graphs with at most four vertices of maximum degree. , 1984 .

[2] Ian Holyer,et al. The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[3] Dean G. Hoffman,et al. On the Delta-subgraph of graphs which are critical with respect to the chromatic index , 1989, J. Comb. Theory, Ser. B.

[4] Robin J. Wilson,et al. Edge-colourings of graphs , 1977 .