On the Lettericity of Paths

MaRDI QIDQ5139708zbMATH OpenFDO

Authors Robert Ferguson

Publication date 10 December 2020

Full work available at URL https://arxiv.org/abs/2007.03636, http://ajc.maths.uq.edu.au/pdf/78/ajc_v78_p348.pdf

zbMATH Keywords

\(k\)-letter graphinterval graphslettericitysubgraph relationthreshold graphswell-quasi-order

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)

Abstract: Verifying a conjecture of Petkov{v{s}}ec, we prove that the lettericity of an n-vertex path is precisely $leftlfloorfracn+43ightfloor$.

Cites work

• The Micro-world of Cographs

Cited in

(4)

• scientific article; zbMATH DE number 3279090 (Why is no real title available?)
• Critical properties of bipartite permutation graphs
• Bounds on the lettericity of graphs
• Generalized lettericity of graphs

This page was built for publication: On the Lettericity of Paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5139708)