Boxicity of a class of split graphs using words

DOI10.1007/978-3-032-17156-6_24MaRDI QIDQ7307333zbMATH OpenFDO

Authors Khyodeno Mozhui, Tithi Dwary

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-17156-6_24

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A special planar satisfiability problem and a consequence of its NP- completeness
• Boxicity and maximum degree
• Boxicity and poset dimension
• Boxicity and treewidth
• Computing the boxicity of a graph by covering its complement by cointerval graphs
• Cubicity of interval graphs and the claw number
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 3307331 (Why is no real title available?)
• On representable graphs
• On semi-transitive orientability of split graphs
• The Complexity of the Partial Order Dimension Problem
• The hardness of approximating the boxicity, cubicity and threshold dimension of a graph
• Word-representability of split graphs
• Words and graphs

This page was built for publication: Boxicity of a class of split graphs using words

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