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

DOI10.1017/S0963548322000268MaRDI QIDQ5885199zbMATH OpenFDO

Authors

Publication date 3 April 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

graph minorsimproper coloringdefective coloringodd minorsclustered coloringodd Hadwiger's conjecture

Mathematics Subject Classification ID

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

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

Cites work

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

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
• Improper colouring of graphs with no odd clique minor
• Improved bound for improper colorings 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)