×

Found 17 Documents (Results 1–17)

On 3-coloring of \((2P_4,C_5)\)-free graphs. (English) Zbl 07538592

Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 388-401 (2021).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Obstructions for three-coloring graphs with one forbidden induced subgraph. (English) Zbl 1410.05063

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1774-1783 (2016).
MSC:  05C15 05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Exhaustive generation of \(k\)-critical \(\mathcal H\)-free graphs. (English) Zbl 1417.05066

Heggernes, Pinar (ed.), Graph-theoretic concepts in computer science. 42nd international workshop, WG 2016, Istanbul, Turkey, June 22–24, 2016. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 9941, 109-120 (2016).
MSC:  05C15 05C85
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field