Graphs containing finite induced paths of unbounded length

DOI10.46298/dmtcs.6915zbMath1498.05086arXiv2011.00352OpenAlexW4220872573MaRDI 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

pathsSturmian wordspartially ordered setincomparability graphwell quasi orderisometric subgraphsymbolic dynamicgraphical distanceuniformly recurrent sequences

Mathematics Subject Classification ID

Combinatorics on words (68R15) Combinatorics of partially ordered sets (06A07) Paths and cycles (05C38) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Unnamed Item

This page was built for publication: Graphs containing finite induced paths of unbounded length