Determining bar-representability for ordered weighted graphs

DOI10.1016/0925-7721(95)00017-8zbMath0849.68124OpenAlexW2022808911MaRDI QIDQ1917046

Stephen K. Wismath, David G. Kirkpatrick

Publication date: 4 November 1996

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00017-8

zbMATH Keywords

bar layoutbar-representable graphsfull flow existence problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On recognizing and characterizing visibility graphs of simple polygons
• Representing a planar graph by vertical lines joining different levels
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• A note on visibility graphs
• Representing orders on the plane by translating convex figures
• Establishing order in planar subdivisions
• Some results on visibility graphs
• Recognizing visibility graphs of spiral polygons
• An application of graph coloring to printed circuit testing

This page was built for publication: Determining bar-representability for ordered weighted graphs