Title of article
Sufficient conditions for a graph to be edge-colorable with maximum degree colors
Author/Authors
Machado، نويسنده , , R.C.S. and de Figueiredo، نويسنده , , C.M.H.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
6
From page
69
To page
74
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
join graph , Edge-coloring , core of a graph , cobipartite graph
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2008
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454818
Link To Document