A note on lower bounds for boxicity of graphs

DOI10.5614/EJGTA.2024.12.1.12zbMATH Open1541.05128MaRDI QIDQ6571572FDOQ6571572

Authors: Akira Kamibeppu 

Publication date: 12 July 2024

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

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

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)

Cites Work

• Title not available (Why is that?)
• Interval representations of planar graphs
• Boxicity and treewidth
• Title not available (Why is that?)
• Boxicity of graphs on surfaces
• Cubicity, boxicity, and vertex cover
• Boxicity of graphs with bounded degree
• Boxicity and maximum degree
• Computing the boxicity of a graph by covering its complement by cointerval graphs
• Boxicity and topological invariants
• Lower bounds for boxicity
• Box representations of embedded graphs
• Better bounds for poset dimension and boxicity
• Boxicity, poset dimension, and excluded minors
• 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)