Caricamento...
Coloring [Formula: see text] -Embeddable [Formula: see text] -Uniform Hypergraphs
This paper extends the scenario of the Four Color Theorem in the following way. Let [Formula: see text] be the set of all [Formula: see text] -uniform hypergraphs that can be (linearly) embedded into [Formula: see text] . We investigate lower and upper bounds on the maximum (weak) chromatic number o...
Salvato in:
| Pubblicato in: | Discrete Comput Geom |
|---|---|
| Autori principali: | , , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Springer US
2014
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4237724/ https://ncbi.nlm.nih.gov/pubmed/25419024 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s00454-014-9641-2 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|