Grid intersection graphs and boxicity (Q685652): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On grid intersection graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5588433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing the boxicity of a graph by covering its complement by cointerval graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Irrepresentability by multiple intersection, or why the interval number is unbounded / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A characterization of Robert's inequality for boxicity / rank | |||
Normal rank | |||
Latest revision as of 09:55, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Grid intersection graphs and boxicity |
scientific article |
Statements
Grid intersection graphs and boxicity (English)
0 references
24 October 1993
0 references
A graph has boxicity \(k\) if \(k\) is the smallest integer such that the graph can be presented as an intersection of parallelepipeds in \(k\)- dimensional space. The bipartite graphs are shown to have boxicity 2. Some inequalities for graphs in higher dimensions are proved.
0 references
grid intersection graphs
0 references
boxicity
0 references
bipartite graphs
0 references
