A Weakening of the Odd Hadwiger's Conjecture

DOI10.1017/S0963548308009462MaRDI QIDQ3608337zbMATH OpenWikidataFDO

Authors Ken-ichi Kawarabayashi

Publication date 4 March 2009

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

Full work available at URL https://doi.org/10.1017/S0963548308009462

Mathematics Subject Classification ID

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

Recommendations

• Some remarks on the odd Hadwiger's conjecture
• Strengthening Hadwiger's Conjecture
• scientific article; zbMATH DE number 99004
• On the odd-minor variant of Hadwiger's conjecture
• On the Hadwiger's conjecture
• A weaker form of Ulam's conjecture
• Partial result on Hadwiger's conjecture
• A special case of Hadwiger's conjecture
• scientific article; zbMATH DE number 7651162
• Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant

Cites work

• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• A bound on the chromatic number of a graph
• A relaxed Hadwiger's conjecture for list colorings
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Lower bound of the Hadwiger number of graphs by their average degree
• Some remarks on the odd Hadwiger's conjecture
• The extremal function for complete minors
• The four-colour theorem
• Über eine Eigenschaft der ebenen Komplexe

Cited in

(20)

• scientific article; zbMATH DE number 7651162 (Why is no real title available?)
• Improved bound for improper colourings of graphs with no odd clique minor
• A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
• Clustered colouring of graph classes with bounded treedepth or pathwidth
• Contractibility and the Hadwiger conjecture
• A relaxed Hadwiger's conjecture for list colorings
• Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
• Some remarks on the odd Hadwiger's conjecture
• Weak form of Holzapfel's conjecture
• Hadwiger's conjecture and topological bounds
• Clustered coloring of graphs with bounded layered treewidth and bounded degree
• Clustered colouring of odd-H-minor-free graphs
• Hadwiger's conjecture
• On the odd-minor variant of Hadwiger's conjecture
• Fractional coloring and the odd Hadwiger's conjecture
• Improper colouring of graphs with no odd clique minor
• On topological relaxations of chromatic conjectures
• Partitioning \(H\)-minor free graphs into three subgraphs with no large components
• Clustered variants of Hajós' conjecture
• Note on coloring graphs without odd-\(K_k\)-minors

This page was built for publication: A Weakening of the Odd Hadwiger's Conjecture

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