The following pages link to A simple proof of Moser's theorem (Q4256103):
Displaying 9 items.
- Planar graphs with circular chromatic numbers between 3 and 4 (Q1306306) (← links)
- Construction of \(K_{n}\)-minor free graphs with given circular chromatic number (Q1869205) (← links)
- Circular chromatic number of signed graphs (Q2034071) (← links)
- The circular chromatic numbers of signed series-parallel graphs (Q2065905) (← links)
- An analogue of Hajós' theorem for the circular chromatic number (Q2723478) (← links)
- A simplified proof of Moufang’s theorem (Q3082280) (← links)
- (Q3468336) (← links)
- (Q4715174) (← links)
- The circular chromatic number of series-parallel graphs with large girth (Q4948748) (← links)