Compatible geometric matchings (Q924079): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Augmenting the connectivity of geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming spanning trees and pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences of spanning trees and a fixed tree theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Erdös-Szekeres convex n-gon theorem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexly independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every set of disjoint line segments admits a binary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming spanning trees: A lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: An orientation theorem with parity conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph orientations with edge-connection and parity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating paths through disjoint line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Segment endpoint visibility graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of triangulations and perfect matchings / 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: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circumscribing polygons for line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical theorems for convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Szekeres-type theorems for segments and noncrossing convex sets / 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: Alternating paths along axis-parallel segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding convex sets in convex positions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a counterexample to a conjecture of Mirzaian / rank
 
Normal rank

Revision as of 19:43, 1 July 2024

scientific article
Language Label Description Also known as
English
Compatible geometric matchings
scientific article

    Statements

    Compatible geometric matchings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 July 2009
    0 references
    geometric graph
    0 references
    compatible matching
    0 references
    convex-hull-connected segments
    0 references
    convexly independent segments
    0 references
    segments in convex position
    0 references
    0 references

    Identifiers

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