Hadwiger number
Results: 3
| # | 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 emAdd to Reading ListSource URL: people.cs.uchicago.eduLanguage: English - Date: 2014-04-12 04:53:59 |
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 CulturaliAdd to Reading ListSource URL: pagesperso.lina.univ-nantes.frLanguage: English - Date: 2013-01-07 10:28:15 |
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](https://www.pdfsearch.io/img/056ab38c173bcb91470c075fa2b10a2f.jpg "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") | 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 aAdd to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2013-12-12 20:44:56 |