Crooked diagrams with few slopes (Q1814184): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jurek Czyzowicz / rank
Normal rank
 
Property / author
 
Property / author: Ivan Rival / rank
Normal rank
 
Property / author
 
Property / author: Jurek Czyzowicz / rank
 
Normal rank
Property / author
 
Property / author: Ivan Rival / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice diagrams with few slopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing orders with few slopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orders with level diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar lattices and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00383762 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055188231 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:37, 30 July 2024

scientific article
Language Label Description Also known as
English
Crooked diagrams with few slopes
scientific article

    Statements

    Crooked diagrams with few slopes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    A natural and practical criterion in preparation of diagrams of ordered set is to minimize the number of different slopes used for the edges, i.e. at least the maximum number of upper covers and lower covers of any element. While this maximum degree is not always enough, it is shown that it is as long as any edge joining a covering pair may be bent to produce a crooked diagram.
    0 references
    0 references
    diagrams
    0 references
    ordered set
    0 references
    slopes
    0 references
    covers
    0 references
    crooked diagram
    0 references
    0 references