Chronological orderings of interval graphs (Q795848): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q127498886, #quickstatements; #temporary_batch_1722342728189
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition algorithm for the intersection graphs of paths in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparability graphs and a new matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of comparability graph recognition and coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices, interval graphs and seriation in archeology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chronological orderings of interval graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(84)90080-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973007407 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127498886 / rank
 
Normal rank

Latest revision as of 13:32, 30 July 2024

scientific article
Language Label Description Also known as
English
Chronological orderings of interval graphs
scientific article

    Statements

    Chronological orderings of interval graphs (English)
    0 references
    0 references
    1984
    0 references
    An interval graph is a graph, which is the intersection graph of a set of intervals of the real line. The set of intervals is called an interval representation of the graph. This paper gives three methods for describing the differences of the order of the endpoints of the intervals along the line.
    0 references
    interval graph
    0 references
    interval representation
    0 references
    intersection graph
    0 references

    Identifiers