Packing plane spanning trees and paths in complete geometric graphs (Q2628273): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q54308471, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1707.05440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite embeddings of trees in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating order types for small point sets with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing families / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book thickness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of complete geometric graphs into plane trees / 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: Noncrossing Hamiltonian paths in geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Thickness of Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a semi-dynamic convex hull algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type results for geometric graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of the number of disjoint spanning trees / 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: Order on Order Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4504031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric graphs with few disjoint edges / 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

Latest revision as of 22:44, 13 July 2024

scientific article
Language Label Description Also known as
English
Packing plane spanning trees and paths in complete geometric graphs
scientific article

    Statements

    Packing plane spanning trees and paths in complete geometric graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 June 2017
    0 references
    combinatorial problems
    0 references
    geometric graph
    0 references
    spanning tree
    0 references
    edge-disjoint graphs
    0 references

    Identifiers

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