On the odd-minor variant of Hadwiger's conjecture
From MaRDI portal
Publication:2519011
DOI10.1016/j.jctb.2008.03.006zbMath1213.05079OpenAlexW2132677029WikidataQ56235102 ScholiaQ56235102MaRDI QIDQ2519011
Adrian Vetta, Bert Gerards, Jim Geelen, P. D. Seymour, Bruce A. Reed
Publication date: 21 January 2009
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/13651
Related Items
Edge-disjoint odd cycles in 4-edge-connected graphs ⋮ Improved bound for improper colourings of graphs with no odd clique minor ⋮ Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant ⋮ Minor relation for quadrangulations on the projective plane ⋮ A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor ⋮ Frames, $A$-Paths, and the Erdös--Pósa Property ⋮ On Modulo Linked Graphs ⋮ Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs ⋮ Packing cycles in undirected group-labelled graphs ⋮ Packing Signatures in Signed Graphs ⋮ Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth ⋮ Tight bounds for divisible subdivisions ⋮ Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem ⋮ Packing cycles through prescribed vertices under modularity constraints ⋮ Linked graphs with restricted lengths ⋮ Odd complete minors in even embeddings on surfaces ⋮ Partitioning \(H\)-minor free graphs into three subgraphs with no large components ⋮ Some remarks on the odd Hadwiger's conjecture ⋮ Fractional coloring and the odd Hadwiger's conjecture ⋮ Half-integral packing of odd cycles through prescribed vertices ⋮ On topological relaxations of chromatic conjectures ⋮ Packing cycles through prescribed vertices ⋮ Circular chromatic number of signed graphs ⋮ Excluding a group-labelled graph ⋮ When Is the Matching Polytope Box-Totally Dual Integral? ⋮ Improper colouring of graphs with no odd clique minor ⋮ Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs ⋮ Hadwiger’s Conjecture ⋮ Note on coloring graphs without odd-\(K_k\)-minors ⋮ Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs ⋮ Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs ⋮ Unnamed Item ⋮ Fixed-parameter tractability for subset feedback set problems with parity constraints ⋮ Even Embeddings of the Complete Graphs and Their Cycle Parities
Cites Work
- Unnamed Item
- Unnamed Item
- Lower bound of the Hadwiger number of graphs by their average degree
- Packing non-zero \(A\)-paths in group-labelled graphs
- Matching theory
- Every planar map is four colorable. I: Discharging
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Graph minors. XIII: The disjoint paths problem
- Homomorphiesätze für Graphen
- An extremal function for contractions of graphs
- Graph decomposition with applications to subdivisions and path systems modulo k
- On Independent Circuits Contained in a Graph
- 25 pretty graph colouring problems
