The non-solvability by radicals of generic 3-connected planar Laman graphs (Q3420400): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The rigidity of graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric constraint solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar minimally rigid graphs and pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5814388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs and rigidity of plane skeletal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction in Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5686123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5798024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3837775 / rank
 
Normal rank

Latest revision as of 13:33, 25 June 2024

scientific article
Language Label Description Also known as
English
The non-solvability by radicals of generic 3-connected planar Laman graphs
scientific article

    Statements

    The non-solvability by radicals of generic 3-connected planar Laman graphs (English)
    0 references
    0 references
    0 references
    1 February 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maximally independent graph
    0 references
    3-connected
    0 references
    algorithms for CAD
    0 references
    solvable by radicals
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references