CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS (Q5493893): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A linear-time algorithm for drawing a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grid embedding of 4-connected plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing planar graphs using the canonical ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grid drawings of 4-connected plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for four-partitioning four-connected planar graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:47, 24 June 2024

scientific article; zbMATH DE number 5064533
Language Label Description Also known as
English
CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
scientific article; zbMATH DE number 5064533

    Statements

    Identifiers