Skip to main navigation Skip to search Skip to main content

Intersection Dimension of Bipartite Graphs

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Abstract

We introduce a concept of intersection dimension of a graph with respect to a graph class. This generalizes Ferrers dimension, boxicity, and poset dimension, and leads to interesting new problems. We focus in particular on bipartite graph classes defined as intersection graphs of two kinds of geometric objects. We relate well-known graph classes such as interval bigraphs, two-directional orthogonal ray graphs, chain graphs, and (unit) grid intersection graphs with respect to these dimensions. As an application of these graph-theoretic results, we show that the recognition problems for certain graph classes are NP-complete.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings
EditorsT.V. Gopal, M. Agrawal, A. Lia, S.B. Cooper
Pages323-340
Number of pages18
ISBN (Electronic)9783319060897
DOIs
Publication statusPublished - 2014
Externally publishedYes

Publication series

SeriesLecture Notes in Computer Science
Volume8402
ISSN0302-9743

Fingerprint

Dive into the research topics of 'Intersection Dimension of Bipartite Graphs'. Together they form a unique fingerprint.

Cite this