Improved bound for improper colourings of graphs with no odd clique minor

DOI10.1017/S0963548322000268MaRDI QIDQ5885199FDOQ5885199

Authors:

Publication date: 3 April 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.02766

Recommendations

• Improper colouring of graphs with no odd clique minor
• Improper colourings inspired by Hadwiger's conjecture
• Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
• A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
• Fractional coloring and the odd Hadwiger's conjecture

zbMATH Keywords

graph minorsimproper coloringdefective coloringodd minorsclustered coloringodd Hadwiger's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Cites Work

• Hadwiger's conjecture
• An extremal function for contractions of graphs
• Title not available (Why is that?)
• Lower bound of the Hadwiger number of graphs by their average degree
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• On the odd-minor variant of Hadwiger's conjecture
• Hajos' graph-coloring conjecture: Variations and counterexamples
• Note on coloring graphs without odd-\(K_k\)-minors
• A Weakening of the Odd Hadwiger's Conjecture
• Improper colourings inspired by Hadwiger's conjecture
• Fractional coloring and the odd Hadwiger's conjecture
• Contractibility and the Hadwiger conjecture
• A relaxed Hadwiger's conjecture for list colorings
• Some remarks on the odd Hadwiger's conjecture
• Defective and clustered graph colouring
• Improper colouring of graphs with no odd clique minor
• A relative of Hadwiger's conjecture
• Connectivity and choosability of graphs with no \(K_t\) minor
• A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
• Partitioning \(H\)-minor free graphs into three subgraphs with no large components
• Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
• Progress towards Nash-Williams' conjecture on triangle decompositions

Cited In (5)

• A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
• Towards a version of Ohba's conjecture for improper colorings
• Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
• Improved bound for improper colorings of graphs with no odd clique minor
• Improper colouring of graphs with no odd clique minor

This page was built for publication: Improved bound for improper colourings of graphs with no odd clique minor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5885199)