Pages that link to "Item:Q5222552"

The following pages link to Improper colouring of graphs with no odd clique minor (Q5222552):

Displaying 12 items.

• Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
• Note on coloring graphs without odd-\(K_k\)-minors (Q1026013) (← links)
• No odd pairs in minimal imperfect NP\({}_{5}\) graphs. (Q1853069) (← links)
• Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant (Q2131858) (← links)
• A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor (Q2151177) (← links)
• Fractional coloring and the odd Hadwiger's conjecture (Q2472835) (← links)
• Clustered variants of Hajós' conjecture (Q2664549) (← links)
• Clustered colouring of graph classes with bounded treedepth or pathwidth (Q5885188) (← links)
• Improved bound for improper colourings of graphs with no odd clique minor (Q5885199) (← links)
• Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
• Clustered coloring of graphs with bounded layered treewidth and bounded degree (Q6612290) (← links)
• Colouring strong products (Q6612523) (← links)