Q5088936 (Q5088936): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.SoCG.2019.9 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On polyhedra induced by point sets in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-degree polyhedronization of point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of crossing-free subgraphs of \(K_N\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Segment endpoint visibility graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane Geometric Graph Augmentation: A Generic Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint compatible geometric matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shooting Permanent Rays among Disjoint Polygons in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Ramsey-Type Result for Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian triangulations and circumscribing polygons of disjoint line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two segment classes with Hamiltonian visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of polyhedra with few 3-cuts. A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circumscribing polygons for line segments / 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: Computing Simple Circuits from a Set of Line Segments is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing simple circuits from a set of line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a counterexample to a conjecture of Mirzaian / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.SOCG.2019.9 / rank
 
Normal rank

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7559209
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7559209

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    18 July 2022
    0 references
    circumscribing polygon
    0 references
    Hamiltonicity
    0 references
    extremal combinatorics
    0 references

    Identifiers