Sufficient conditions for a graph to be edge-colorable with maximum degree colors |
| |
Affiliation: | COPPE, Universidade Federal do Rio de Janeiro Rio de Janeiro, Brazil |
| |
Abstract: | We study properties of graphs related to the existence of certain vertex and edge partitions. These properties give sufficient conditions for a graph to be Class 1 (i.e., edge-colorable with maximum degree colors). We apply these conditions for solving the classification problem for graphs with acyclic core (the subgraph induced by the maximum degree vertices), and for subclasses of join graphs and cobipartite graphs. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|