Rectangle-visibility representations of bipartite graphs

DOI10.1016/S0166-218X(96)00029-7zbMath0878.68092MaRDI QIDQ1363757

Joan P. Hutchinson, Alice M. Dean

Publication date: 11 August 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

VLSI design; complete bipartite graphs; rectangle-visibility graphs

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C99: Graph theory

Related Items

3D Visibility Representations of 1-planar Graphs, Unnamed Item, Minimal Embedding Dimensions of Rectangle k-Visibility Graphs, Ortho-polygon visibility representations of 3-connected 1-plane graphs, Combinatorial properties and recognition of unit square visibility graphs, Area, perimeter, height, and width of rectangle visibility graphs, Ortho-polygon visibility representations of embedded graphs, Rectangle-visibility representations of bipartite graphs, A tribute to Frank Harary (in honor of his 70th birthday), Visibility representations of boxes in 2.5 dimensions, Colored anchored visibility representations in 2D and 3D space, On 3D visibility representations of graphs with few crossings per edge, Unit hypercube visibility numbers of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified approach to visibility representations of planar graphs
• A note on visibility graphs
• Some results on visibility graphs
• Rectangle-visibility representations of bipartite graphs
• On representations of some thickness-two graphs
• Determining the thickness of graphs is NP-hard
• An application of graph coloring to printed circuit testing
• Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon