On convex geometric graphs with no \(k+1\) pairwise disjoint edges (Q503641): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On grids in topological graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint edges in geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Turán-type theorem on chords of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric graphs with no three disjoint edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On line arrangements in the hyperbolic plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Distances of n Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Edges in $k$-Quasi-planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized triangulations and diagonal-free subsets of stack polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the smallest sets blocking simple perfect matchings in a convex geometric graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3676164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4589014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric graphs with few disjoint edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615942 / rank
 
Normal rank

Revision as of 06:49, 13 July 2024

scientific article
Language Label Description Also known as
English
On convex geometric graphs with no \(k+1\) pairwise disjoint edges
scientific article

    Statements

    Identifiers