Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation

DOI10.4310/JOC.2019.v10.n2.a8zbMath1403.05036OpenAlexW2964269082WikidataQ128528154 ScholiaQ128528154MaRDI QIDQ1713790

Igor Razgon, Aistis Atminas, Vadim V. Lozin

Publication date: 28 January 2019

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2019.v10.n2.a8

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (1)

Long induced paths in minor-closed graph classes and beyond

This page was built for publication: Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation