On the cubicity of certain graphs
type: Item
instance of: scholarly article
title: On the cubicity of certain graphs
zbMATH Open document ID: 1186.05090
author: L. Sunil Chandran
author: Carlo Mannino
author: Gianpaolo Oriolo
published in: Information Processing Letters
publication date: 2009-12-04T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5642327
zbMATH Keywords: combinatorial problems
zbMATH Keywords: cubicity
zbMATH Keywords: boxicity
zbMATH Keywords: hypercube
zbMATH Keywords: stability number
zbMATH Keywords: clique number
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.01.001
OpenAlex ID: W1986528255
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Grid intersection graphs and boxicity
cites work: Q4489219
cites work: Computing the boxicity of a graph by covering its complement by cointerval graphs
cites work: The circular dimension of a graph
cites work: Optimal packing and covering in the plane are NP-complete
cites work: Extremal Values of the Interval Number of a Graph
cites work: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
cites work: A special planar satisfiability problem and a consequence of its NP- completeness
cites work: Q5588433
cites work: A note on circular dimension
cites work: Interval representations of planar graphs
cites work: When the cartesian product of directed cycles is Hamiltonian
cites work: Poset boxicity of graphs
cites work: The Complexity of the Partial Order Dimension Problem
DOI: 10.1016/J.IPL.2005.01.001
description: scientific article; zbMATH DE number 5642327