Characterization of the graphs with boxicity \(\leq 2\)

DOI10.1016/0012-365X(90)90151-7zbMath0725.05070OpenAlexW2009945076MaRDI QIDQ2277492

Martin Quest, G. Wegner

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90151-7

zbMATH Keywords

incidence matrixcliquesboxicityincidence graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items (4)

Chronological rectangle digraphs ⋮ Max point-tolerance graphs ⋮ A constant factor approximation algorithm for boxicity of circular arc graphs ⋮ Boxicity of Halin graphs

Cites Work

• Interval graphs and related topics
• Incidence matrices and interval graphs
• Representation of a finite graph by a set of intervals on the real line
• Unnamed Item

This page was built for publication: Characterization of the graphs with boxicity \(\leq 2\)