Document Type

Journal Article

Department/Unit

Department of Mathematics

Language

English

Abstract

In 1993, Brualdi and Massey conjectured that every graph can be incidence-colored withΔ+2 colors, where Δ is the maximum degree of a graph. Although this conjecture was solved in the negative by an example in I. Algor and N. Alon (Discrete Math. 75 (1989) 11) it might hold for some special classes of graphs. In this paper, we consider graphs with maximum degree Δ=3 and show that the conjecture holds for cubic Hamiltonian graphs and some other cubic graphs.

Keywords

Cubic graph, Incidence coloring, Restrained decomposition

Publication Date

2002

Source Publication Title

Discrete Mathematics

Volume

252

Issue

1-3

Start Page

259

End Page

266

Publisher

Elsevier

Peer Reviewed

1

DOI

10.1016/S0012-365X(01)00457-5

Link to Publisher's Edition

https://dx.doi.org/10.1016/S0012-365X(01)00457-5

ISSN (print)

1872681X

Included in

Mathematics Commons

Share

COinS