Geometric graphs with no self-intersecting path of length three (Q1883291): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Géza Tóth / rank
Normal rank
 
Property / author
 
Property / author: Géza Tóth / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2003.09.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036775915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-planar graphs have a linear number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small forbidden configurations. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small forbidden configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Turán type problem of Erdős / rank
 
Normal rank
Property / cites work
 
Property / cites work: Davenport-Schinzel theory of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs drawn with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological graphs with no self-intersecting cycle of length 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On geometric graphs with no \(k\) pairwise parallel edges / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:16, 7 June 2024

scientific article
Language Label Description Also known as
English
Geometric graphs with no self-intersecting path of length three
scientific article

    Statements

    Geometric graphs with no self-intersecting path of length three (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 October 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    geometric graph
    0 references
    self-intersecting path
    0 references
    straight-line edges
    0 references
    0 references