Maribor Graph Theory Problems 2005

Problem 2005.1

Characterizing induced subgraphs of Hamming graphs
(Iztok Peterin)

Problem 2005.2

C7-colorability of triangle-free hexagonal graphs
(Petra Šparl, Janez Žerovnik)

Problem 2005.3

Coloring of the Θ-graph of a median graph
(Boštjan Brešar)
solution (a negative example) and related results

Problem 2005.4

Connectivity of strong products of graphs
(Simon Špacapan)
solution of 2005.4

Problem 2005.5

Nonplanar cubic partial cubes
(Sandi Klavžar)