The following pages link to (Q5837979):
Displaying 50 items.
- Bicircular matroids are 3-colorable (Q271597) (← links)
- Dynamic coloring of graphs having no \(K_5\) minor (Q277625) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Hadwiger's conjecture for inflations of 3-chromatic graphs (Q499451) (← links)
- Odd complete minors in even embeddings on surfaces (Q501046) (← links)
- Complete graph immersions in dense graphs (Q512586) (← links)
- Large minors in graphs with given independence number (Q641195) (← links)
- \(K_{6}\) minors in large 6-connected graphs (Q684126) (← links)
- On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs (Q709320) (← links)
- Contractibility and the Hadwiger conjecture (Q710728) (← links)
- Hadwiger's conjecture for 3-arc graphs (Q727197) (← links)
- Lower bound of the Hadwiger number of graphs by their average degree (Q760439) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Clique minors in claw-free graphs (Q765191) (← links)
- On a new reformulation of Hadwiger's conjecture (Q856862) (← links)
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture (Q858685) (← links)
- Hadwiger's conjecture for circular colorings of edge-weighted graphs (Q864127) (← links)
- On the Hadwiger's conjecture for graph products (Q864168) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Graphs without minor complete subgraphs (Q878614) (← links)
- Distance constraints in graph color extensions (Q885289) (← links)
- A relaxed Hadwiger's conjecture for list colorings (Q885300) (← links)
- Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
- A basic elementary extension of the Duchet-Meyniel theorem (Q960956) (← links)
- A note on graph minors and strong products (Q990784) (← links)
- The edge version of Hadwiger's conjecture (Q1011784) (← links)
- Hadwiger number and the Cartesian product of graphs (Q1014821) (← links)
- Hadwiger's conjecture for proper circular arc graphs (Q1024291) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Note on coloring graphs without odd-\(K_k\)-minors (Q1026013) (← links)
- List-coloring graphs without \(K_{4,k}\)-minors (Q1028458) (← links)
- Cliques, minors and apex graphs (Q1043579) (← links)
- Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs (Q1119593) (← links)
- Hadwiger's conjecture for graphs on the Klein bottle (Q1142782) (← links)
- Kempe classes and the Hadwiger conjecture (Q1157337) (← links)
- On Tutte's extension of the four-colour problem (Q1157338) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- On Hadwiger's number---A problem of the Nordhaus-Gaddum type (Q1197037) (← links)
- S-functions for graphs (Q1230790) (← links)
- Hajos' graph-coloring conjecture: Variations and counterexamples (Q1249185) (← links)
- Hadwiger's conjecture for \(K_ 6\)-free graphs (Q1311018) (← links)
- Fractional colouring and Hadwiger's conjecture (Q1569032) (← links)
- Clique minors in graphs and their complements (Q1569065) (← links)
- Hadwiger's conjecture for squares of 2-trees (Q1633613) (← links)
- On critical exponents of Dowling matroids (Q1650807) (← links)
- On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge (Q1661493) (← links)
- Rooted complete minors in line graphs with a Kempe coloring (Q1741595) (← links)
- The extremal function for Petersen minors (Q1748273) (← links)
