The following pages link to (Q5837979):
Displaying 50 items.
- Hadwiger's conjecture and inflations of the Petersen graph (Q1759395) (← links)
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor (Q1767621) (← links)
- On the conjecture of Hajos (Q1835686) (← links)
- Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
- The extremal function for complete minors (Q1850528) (← links)
- On clique immersions in line graphs (Q2005686) (← links)
- On group choosability of graphs. II (Q2014707) (← links)
- Clique immersions in graphs of independence number two with certain forbidden subgraphs (Q2022152) (← links)
- Simple graphs of order 12 and minimum degree 6 contain \(K_6\) minors (Q2036707) (← links)
- Notes on tree- and path-chromatic number (Q2058953) (← links)
- Dichromatic number and forced subdivisions (Q2072176) (← links)
- The characterization of graphs with no 2-connected spanning subgraph of \(V_8\) as a minor (Q2087665) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Immersion and clustered coloring (Q2099417) (← links)
- Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418) (← links)
- Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant (Q2131858) (← links)
- Large immersions in graphs with independence number 3 and 4 (Q2132349) (← links)
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor (Q2151177) (← links)
- Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs (Q2153396) (← links)
- Some remarks on even-hole-free graphs (Q2161221) (← links)
- Clique immersion in graphs without a fixed bipartite graph (Q2171024) (← links)
- Efficient generation of different topological representations of graphs beyond-planarity (Q2206855) (← links)
- Maximal ambiguously \(k\)-colorable graphs (Q2284731) (← links)
- Erdős-Lovász Tihany conjecture for graphs with forbidden holes (Q2312803) (← links)
- Minimum degree condition for a graph to be knitted (Q2324511) (← links)
- A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two (Q2329179) (← links)
- Packing seagulls (Q2392035) (← links)
- Coloring graphs with forbidden minors (Q2407377) (← links)
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width (Q2421546) (← links)
- Sketchy tweets: ten minute conjectures in graph theory (Q2429454) (← links)
- On cyclically orientable graphs (Q2463474) (← links)
- Fractional coloring and the odd Hadwiger's conjecture (Q2472835) (← links)
- The extremal function for \(K_{9}\) minors (Q2490252) (← links)
- Reducing Hajós' 4-coloring conjecture to 4-connected graphs (Q2496200) (← links)
- On the odd-minor variant of Hadwiger's conjecture (Q2519011) (← links)
- A case of Hadwiger's conjecture (Q2556339) (← links)
- The extremal function for \(K_{8}^{-}\) minors (Q2573648) (← links)
- Clique immersions and independence number (Q2674557) (← links)
- Triangle-free projective-planar graphs with diameter two: domination and characterization (Q2691564) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor (Q2700634) (← links)
- Properties of 8-contraction-critical graphs with no \(K_7\) minor (Q2701012) (← links)
- Hadwiger’s Conjecture and Squares of Chordal Graphs (Q2817883) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- A Characterization of Graphs with No Octahedron Minor (Q2853334) (← links)
- Constructing Graphs with No Immersion of Large Complete Graphs (Q2922213) (← links)
- Hadwiger Number of Graphs with Small Chordality (Q2945190) (← links)
- Hadwiger's Conjecture for the Complements of Kneser Graphs (Q2958193) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- Hadwiger number and chromatic number for near regular degree sequences (Q3055914) (← links)
