Carregant...
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...
Guardat en:
| Publicat a: | Discrete Comput Geom |
|---|---|
| Autors principals: | , , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Springer US
2014
|
| Matèries: | |
| Accés en línia: | 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 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|