On embedding triconnected cubic graphs on point sets (Q3503515): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61732492, #quickstatements; #temporary_batch_1711504539957
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding an outer-planar graph in a point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Algorithms to Embed Trees in a Point Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rooted tree embedding problem into points in the plane / 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: Straight-line embeddings of two rooted trees in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138292 / 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: Degree constrained tree embedding into points in the plane / rank
 
Normal rank

Latest revision as of 11:22, 28 June 2024

scientific article
Language Label Description Also known as
English
On embedding triconnected cubic graphs on point sets
scientific article

    Statements

    On embedding triconnected cubic graphs on point sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 June 2008
    0 references
    0 references
    cubic graphs
    0 references
    geometric graphs
    0 references
    3-connected graphs
    0 references
    embeddings in the plane
    0 references
    0 references
    0 references