A note on lower bounds for boxicity of graphs

DOI10.5614/EJGTA.2024.12.1.12MaRDI QIDQ6571572zbMATH OpenFDO

Authors Akira Kamibeppu

Publication date 12 July 2024

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

hypergraphboxicity(co)interval graphinteger/linear program

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Lower bounds for boxicity
• Cubicity, boxicity, and vertex cover
• Boxicity of line graphs
• Geometric Representation of Graphs in Low Dimension
• Local and union boxicity

Cites work

• scientific article; zbMATH DE number 3566474 (Why is no real title available?)
• scientific article; zbMATH DE number 3307331 (Why is no real title available?)
• Better bounds for poset dimension and boxicity
• Box representations of embedded graphs
• Boxicity and maximum degree
• Boxicity and topological invariants
• Boxicity and treewidth
• Boxicity of graphs on surfaces
• Boxicity of graphs with bounded degree
• Boxicity, poset dimension, and excluded minors
• Computing the boxicity of a graph by covering its complement by cointerval graphs
• Cubicity, boxicity, and vertex cover
• Interval representations of planar graphs
• Lower bounds for boxicity
• On the distribution of roots of algebraic equations with integral coefficients

This page was built for publication: A note on lower bounds for boxicity of graphs

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