Boxicity of graphs with bounded degree
type: Item
instance of: scholarly article
title: Boxicity of graphs with bounded degree
zbMATH Open document ID: 1229.05140
author: L. Esperet
published in: European Journal of Combinatorics
publication date: 2009-06-17T00:00:00Z
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5565573
zbMATH Keywords: maximum degree
MaRDI profile type: Publication
full work available at URL: j.ejc.2008.10.003
OpenAlex ID: W2106120818
cites work: Boxicity and treewidth
cites work: Boxicity and maximum degree
cites work: Computing the boxicity of a graph by covering its complement by cointerval graphs
cites work: A special planar satisfiability problem and a consequence of its NP- completeness
cites work: On the chordality of a graph
cites work: Q3924236
cites work: Q5588433
cites work: Q4138414
cites work: Interval representations of planar graphs
DOI: 10.1016/J.EJC.2008.10.003
description: scientific article; zbMATH DE number 5565573