Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Romain Bourneuf, Jana Masaříková, Wojciech Nadara, and Marcin Pilipczuk

Journal title: 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025

Journal publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Published year: 2025

DOI identifier: 10.4230/lipics.mfcs.2025.28