Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs

DOI10.1016/j.jctb.2020.02.001zbMath1440.05131OpenAlexW3006616331MaRDI QIDQ1985455

Louigi Addario-Berry, Maria Chudnovsky, P. D. Seymour, Bruce A. Reed, Frédéric Havet

Publication date: 7 April 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2020.02.001

zbMATH Keywords

colouringinduced subgraphsbisimplicial verticeseven holes

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Finding a shortest even hole in polynomial time ⋮ A better upper bound on the chromatic number of (cap, even-hole)-free graphs

Cites Work

• Unnamed Item
• Bisimplicial vertices in even-hole-free graphs
• Even-hole-free graphs still have bisimplicial vertices

This page was built for publication: Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs