Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$ (Q5014139): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Partitions of complete geometric graphs into plane trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book thickness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing plane spanning trees into a point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3672042 / 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: Enumeration of simple complete topological graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for the existence of plane spanning trees on geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph crossing number and its variants: a survey / rank
 
Normal rank

Latest revision as of 08:36, 27 July 2024

scientific article; zbMATH DE number 7436639
Language Label Description Also known as
English
Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$
scientific article; zbMATH DE number 7436639

    Statements

    Identifiers