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: | Jelínek, Vít, Klimošová, Tereza, Masařík, Tomáš, Novotná, Jana, Pokorná, Aneta |
---|---|
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 |
Ejemplares similares
-
Subdivision of graphs in [Formula: see text]
por: Wijaya, Kristiana, et al.
Publicado: (2020) -
Coloring [Formula: see text] -Embeddable [Formula: see text] -Uniform Hypergraphs
por: Heise, Carl Georg, et al.
Publicado: (2014) -
Measurement of polarization observables [Formula: see text] , [Formula: see text] , and [Formula: see text] in [Formula: see text] and [Formula: see text] photoproduction off quasi-free nucleons
por: Jermann, N., et al.
Publicado: (2023) -
Mycielski Graphs and [Formula: see text] Proofs
por: Yolcu, Emre, et al.
Publicado: (2020) -
Which graphs are rigid in [Formula: see text] ?
por: Dewar, Sean, et al.
Publicado: (2021)