Graph-theoretical conditions for inscribability and Delaunay realizability (Q1356410): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi diagrams from convex hulls / 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: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian cycles in Delaunay triangulations is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple method for resolving degeneracies in Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A LINEAR-TIME ALGORITHM FOR TESTING THE INSCRIBABILITY OF TRIVALENT POLYHEDRA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in simplicial complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4066167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some problems on polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortness exponents of families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on inscribability of quadrangular polyhedra with restricted number of edge-types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of ideal polyhedra in hyperbolic 3-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On geometry of convex ideal polyhedra in hyperbolic 3-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected projective planar graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar and infinite hypohamiltonian and hypotraceable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridges and Hamiltonian circuits in planar graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(95)00276-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966798156 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:59, 30 July 2024

scientific article
Language Label Description Also known as
English
Graph-theoretical conditions for inscribability and Delaunay realizability
scientific article

    Statements

    Graph-theoretical conditions for inscribability and Delaunay realizability (English)
    0 references
    0 references
    0 references
    15 September 1997
    0 references
    polyhedron
    0 references
    Hamiltonian
    0 references
    Delaunay triangulations
    0 references
    matchings
    0 references
    inscribable type
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references