Pages that link to "Item:Q1311018"
From MaRDI portal
The following pages link to Hadwiger's conjecture for \(K_ 6\)-free graphs (Q1311018):
Displaying 50 items.
- Bicircular matroids are 3-colorable (Q271597) (← links)
- Dynamic coloring of graphs having no \(K_5\) minor (Q277625) (← links)
- Excluded-minor characterization of apex-outerplanar graphs (Q292261) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Rooted \(K_4\)-minors (Q396793) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Hadwiger's conjecture for inflations of 3-chromatic graphs (Q499451) (← links)
- Odd complete minors in even embeddings on surfaces (Q501046) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Complete graph immersions in dense graphs (Q512586) (← links)
- Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\) (Q536211) (← links)
- Large minors in graphs with given independence number (Q641195) (← links)
- \(K_{6}\) minors in large 6-connected graphs (Q684126) (← links)
- Contractibility and the Hadwiger conjecture (Q710728) (← links)
- On topological relaxations of chromatic conjectures (Q710730) (← links)
- Hadwiger's conjecture for 3-arc graphs (Q727197) (← links)
- Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture (Q744154) (← 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)
- Distance constraints in graph color extensions (Q885289) (← links)
- A relaxed Hadwiger's conjecture for list colorings (Q885300) (← links)
- Complete partitions of graphs (Q949754) (← links)
- Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
- A basic elementary extension of the Duchet-Meyniel theorem (Q960956) (← 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)
- Some connectivity properties for excluded minors of the graph invariant \(\nu(G)\) (Q1413238) (← 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 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)
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor (Q1767621) (← links)
- Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
- Rooted minor problems in highly connected graphs (Q1886348) (← links)
- On clique immersions in line graphs (Q2005686) (← links)
- On group choosability of graphs. II (Q2014707) (← 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)
- Additive non-approximability of chromatic number in proper minor-closed classes (Q2099409) (← links)
