An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. It was conjectured that every simple graph G with maximum degree Delta is acyclically edge-(Delta + 2)-colorable. In this paper, we confirm the conjecture for chordal graphs G with Delta <= 6.
机构:
Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Dept Math, IL-69978 Tel Aviv, IsraelTel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Dept Math, IL-69978 Tel Aviv, Israel
Alon, N
;
Sudakov, B
论文数: 0引用数: 0
h-index: 0
机构:Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Dept Math, IL-69978 Tel Aviv, Israel
Sudakov, B
;
Zaks, A
论文数: 0引用数: 0
h-index: 0
机构:Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Dept Math, IL-69978 Tel Aviv, Israel
机构:
Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Dept Math, IL-69978 Tel Aviv, IsraelTel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Dept Math, IL-69978 Tel Aviv, Israel
Alon, N
;
Sudakov, B
论文数: 0引用数: 0
h-index: 0
机构:Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Dept Math, IL-69978 Tel Aviv, Israel
Sudakov, B
;
Zaks, A
论文数: 0引用数: 0
h-index: 0
机构:Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Dept Math, IL-69978 Tel Aviv, Israel