Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Circular‐Arc Bigraphs and Its Subclasses / 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: Q3797239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2995145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New characterizations of proper interval bigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and digraphs represented by intervals and circular arcs / 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: Incidence matrices with the consecutive 1’s property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Roberts characterization of proper and unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3663338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4201932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval bigraphs and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the canonical representation and star system problems for proper circular-arc graphs in logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs with application to the minimum buffer size problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal greedy algorithms for indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval hypergraphs and D-interval hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the compatibility between a graph and a simple order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Bracelets in Constant Amortized Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recognition of indifference digraphs and generalized semiorders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix characterizations of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure theorem for the consecutive 1's property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure theorems for some circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs for interval digraphs / rank
 
Normal rank

Revision as of 14:52, 25 July 2024

scientific article; zbMATH DE number 7340682
Language Label Description Also known as
English
Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs
scientific article; zbMATH DE number 7340682

    Statements

    Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (English)
    0 references
    0 references
    28 April 2021
    0 references
    circular-ones property
    0 references
    circularly compatible ones
    0 references
    proper circular-arc bigraphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references