Hadwiger number

#	Item
1	Rooted pointwise limit of graphs Papergives an asymptotic characterization of connected finite vertextransitive graphs of bounded (orientable or non-orientable) genus. All but a finite number of such graphs are em Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2014-04-12 04:53:59 Graph theory Algebraic graph theory Vertex-transitive graph Hadwiger number Graph minor Graph End Symmetric graph Planar graph
2	Finding Approximate and Constrained Motifs in Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2013-01-07 10:28:15 Graph coloring NP-complete problems Bipartite graph Parity Graph theory Treewidth Vertex cover Cubic graph Cograph Hadwiger number
3	A WEAK FORM OF HADWIGER’S CONJECTURE DOMINIC VAN DER ZYPEN arXiv:1312.2829v3 [math.CO] 12 Dec[removed]Abstract. We introduce the following weak version of Hadwiger’s conjecture: If G is a Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-12-12 20:44:56 Conjectures Set theory Tree Hadwiger conjecture Clique Minor Cardinal number Degeneracy Graph theory Mathematics Graph coloring