DiscoverCombinatorics and Statistical MechanicsBounding chromatic roots of series parallel graphs in terms of maxmaxflow
Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

Update: 2008-07-01
Share

Description

Royle, G (Western Australia)
Thursday 12 June 2008, 11:00-12:00
Comments 
loading
00:00
00:00
x

0.5x

0.8x

1.0x

1.25x

1.5x

2.0x

3.0x

Sleep Timer

Off

End of Episode

5 Minutes

10 Minutes

15 Minutes

30 Minutes

45 Minutes

60 Minutes

120 Minutes

Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

Bounding chromatic roots of series parallel graphs in terms of maxmaxflow

Steve Greenham