Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs (Q4857436): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4201932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank
 
Normal rank

Latest revision as of 07:41, 24 May 2024

scientific article; zbMATH DE number 821626
Language Label Description Also known as
English
Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
scientific article; zbMATH DE number 821626

    Statements

    Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs (English)
    0 references
    0 references
    0 references
    8 April 1996
    0 references
    interval graphs
    0 references
    intersection graphs
    0 references
    circular are graphs
    0 references
    comparability graphs
    0 references
    algorithms
    0 references
    recognition
    0 references
    representation
    0 references
    orientations
    0 references
    tournament
    0 references
    lexicographic two-coloring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references