Pages that link to "Item:Q2519011"
From MaRDI portal
The following pages link to On the odd-minor variant of Hadwiger's conjecture (Q2519011):
Displaying 39 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Minor relation for quadrangulations on the projective plane (Q298993) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- Odd complete minors in even embeddings on surfaces (Q501046) (← links)
- On topological relaxations of chromatic conjectures (Q710730) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Linked graphs with restricted lengths (Q933678) (← links)
- Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
- Note on coloring graphs without odd-\(K_k\)-minors (Q1026013) (← links)
- Circular chromatic number of signed graphs (Q2034071) (← 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)
- Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
- Packing cycles through prescribed vertices (Q2275896) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- Fractional coloring and the odd Hadwiger's conjecture (Q2472835) (← links)
- Excluding a group-labelled graph (Q2519025) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs (Q2827821) (← links)
- A Weakening of the Odd Hadwiger's Conjecture (Q3608337) (← links)
- Frames, $A$-Paths, and the Erdös--Pósa Property (Q4564886) (← links)
- Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs (Q4978443) (← links)
- When Is the Matching Polytope Box-Totally Dual Integral? (Q5219300) (← links)
- Improper colouring of graphs with no odd clique minor (Q5222552) (← links)
- Even Embeddings of the Complete Graphs and Their Cycle Parities (Q5272641) (← links)
- On Modulo Linked Graphs (Q5321708) (← links)
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs (Q5346553) (← links)
- (Q5743513) (← links)
- Improved bound for improper colourings of graphs with no odd clique minor (Q5885199) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769) (← links)
- Packing cycles in undirected group-labelled graphs (Q6038589) (← links)
- Packing Signatures in Signed Graphs (Q6057805) (← links)
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth (Q6080127) (← links)
- Tight bounds for divisible subdivisions (Q6187340) (← links)
- Perfect matching in random graphs is as hard as Tseitin (Q6562700) (← links)
- Coloring hypergraphs with excluded minors (Q6568846) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
- Hadwiger's conjecture and topological bounds (Q6612303) (← links)
