Every triangle-free planar graph has a planar upward drawing

DOI10.1007/BF01108704zbMath0790.05034MaRDI QIDQ1311415

Ivan Rival, Andrzej P. Kisielewicz

Publication date: 22 June 1994

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

partially ordered setHasse diagramplanar upward drawingtriangle- free planar graph

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Obituary: Ivan Rival

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating orientations of ordered sets
• Bipartite graphs, upward drawings, and planarity
• Fundamentals of planar ordered sets
• Algorithms for plane representations of acyclic digraphs
• Lattices contained in planar orders are planar
• Planar lattices and planar graphs
• Complexity of diagrams
• Bemerkungen zum Vierfarbenproblem
• Efficient Planarity Testing
• Planar Lattices

This page was built for publication: Every triangle-free planar graph has a planar upward drawing