Cargando…
On 3-Coloring of ([Formula: see text] )-Free Graphs
The 3-coloring of hereditary graph classes has been a deeply-researched problem in the last decade. A hereditary graph class is characterized by a (possibly infinite) list of minimal forbidden induced subgraphs [Formula: see text] ; the graphs in the class are called [Formula: see text] -free. The c...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9148298/ https://www.ncbi.nlm.nih.gov/pubmed/35651539 http://dx.doi.org/10.1007/s00453-022-00937-9 |