Pages that link to "Item:Q2151177"
From MaRDI portal
The following pages link to A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor (Q2151177):
Displaying 8 items.
- Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
- Note on coloring graphs without odd-\(K_k\)-minors (Q1026013) (← links)
- Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418) (← links)
- Coloring graphs with forbidden minors (Q2407377) (← links)
- Improper colouring of graphs with no odd clique minor (Q5222552) (← links)
- Improved bound for improper colourings of graphs with no odd clique minor (Q5885199) (← links)
- A new upper bound on the chromatic number of graphs with no odd $K_t$ minor (Q6331224) (← links)
- Hadwiger's conjecture and topological bounds (Q6612303) (← links)