BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: Two incidences (u\,e) and (v\,f) of vertices u\, v and edges e
\, f (respectively) are adjacent if u=v\, or e=f\, or uv is one of edges e\
, f. An incidence coloring of a graph G is a coloring of its incidences suc
h that adjacent incidences have distinct colors. We show that every graph o
f maximal degree 4 has an incidence coloring with 7 colors. Furthermore\, w
e present sufficient conditions for Cartesian product graphs to have incide
nce colorings with Delta+2 colors where Delta is the maximal degree. In par
ticular\, we confirm a conjecture of Pai et al. on incidence colorings of h
ypercubes. Joint work with B. Lužar and R. Soták.
DTSTAMP:20181120T145900
DTSTART:20181203T160000
CLASS:PUBLIC
LOCATION:Freie Universität Berlin \n Institut für Informatik \n Takustr. 9
\n 14195 Berlin \n Room 005 (Ground Floor)
SEQUENCE:0
SUMMARY:Petr Gregor (Charles University\, Prague): Incidence colorings of s
ubquartic graphs and Cartesian products
UID:94649702@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20181203-C-Gregor.html
END:VEVENT
END:VCALENDAR