Recognizing line-polar bipartite graphs in time \(O(n)\) (Q602675): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-Polar Graphs: Characterization and Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polar Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polarity of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polar cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A forbidden subgraph characterization of line-polar bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 10:55, 3 July 2024

scientific article
Language Label Description Also known as
English
Recognizing line-polar bipartite graphs in time \(O(n)\)
scientific article

    Statements

    Recognizing line-polar bipartite graphs in time \(O(n)\) (English)
    0 references
    0 references
    0 references
    5 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    polar graph
    0 references
    line-polar graph
    0 references
    linear time recognition algorithm
    0 references
    0 references