Graphs containing finite induced paths of unbounded length

DOI10.46298/dmtcs.6915zbMath1498.05086arXiv2011.00352MaRDI QIDQ5038200

Maurice Pouzet, Imed Zaguia

Publication date: 30 September 2022

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.00352

zbMATH Keywords

paths; Sturmian words; partially ordered set; incomparability graph; well quasi order; isometric subgraph; symbolic dynamic; graphical distance; uniformly recurrent sequences

Mathematics Subject Classification ID

68R15: Combinatorics on words

06A07: Combinatorics of partially ordered sets

05C38: Paths and cycles

05C12: Distance in graphs

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)