NP-completeness of 4-incidence colorability of semi-cubic graphs

Abstract

The incidence coloring conjecture, proposed by Brualdi and Massey in 1993, states that the incidence coloring number of every graph is at most ∆ + 2, where ∆ is the maximum degree of a graph. The conjecture was shown to be false in general by Guiduli in 1997, following the work of Algor and Alon. However, in 2005 Maydanskiy proved that the conjecture holds… (More)
DOI: 10.1016/j.disc.2007.03.076

10 Figures and Tables

Topics

  • Presentations referencing similar topics