Boxicity of zero divisor graphs
From MaRDI portal
Cites work
- A survey on the boxicity and cubicity of graphs
- An upper bound for cubicity in terms of boxicity
- Arboricity and Subgraph Listing Algorithms
- Better bounds for poset dimension and boxicity
- Bounds for boxicity of circular clique graphs and zero-divisor graphs
- Boxicity and cubicity of a subclass of divisor graphs and power graphs of cyclic groups
- Boxicity and cubicity of asteroidal triple free graphs
- Boxicity and separation dimension
- Boxicity and treewidth
- Boxicity of circular arc graphs
- Boxicity of line graphs
- Chordal bipartite graphs with high boxicity
- Coloring of commutative rings
- Commutative Boolean monoids, reduced rings, and the compressed zero-divisor graph
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- Cubicity and bandwidth
- Cubicity of interval graphs and the claw number
- Cubicity, boxicity, and vertex cover
- Cubicity, degeneracy, and crossing number
- Geometric representation of graphs in low dimension using axis parallel boxes
- scientific article; zbMATH DE number 3737705 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3606214 (Why is no real title available?)
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- Intersection dimensions of graph classes
- Interval representations of planar graphs
- Linear degree extractors and the inapproximability of max clique and chromatic number
- On grid intersection graphs
- On the cubicity of certain graphs
- On the zero-divisor graph of a commutative ring
- The zero-divisor graph of a commutative ring
- Zero-divisor graphs in commutative rings
- Zero-divisor graphs, von Neumann regular rings, and Boolean algebras.
This page was built for publication: Boxicity of zero divisor graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289229)