Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62042519, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Drawing Colored Graphs on Colored Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-colored Point-set Embeddability of Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curve-constrained drawings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Book embeddability of series-parallel digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON EMBEDDING A GRAPH ON TWO SETS OF POINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Upward Topological Book Embeddings of Upward Planar Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the thickness of graphs of given degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs. Methods and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Vertices at Points: Few Bends Suffice for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding planar graphs at fixed vertex locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioned Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing and Applications for Software and Knowledge Engineers / rank
 
Normal rank

Latest revision as of 21:40, 2 July 2024

scientific article
Language Label Description Also known as
English
Drawing colored graphs with constrained vertex positions and few bends per edge
scientific article

    Statements

    Drawing colored graphs with constrained vertex positions and few bends per edge (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    point-set embedding
    0 references
    book embedding
    0 references
    Hamiltonicity
    0 references
    graph drawing
    0 references
    0 references
    0 references