Partial characterizations of circle graphs (Q643006): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial characterizations of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing prime graphs and recognizing circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting a Theta or a Prism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diamond-free circle graphs are Helly circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4810370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time recognition of unit circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions under pivoting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Brittle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a unique tree representation for \(P_ 4\)-extendible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the problem of domino recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient construction of unit circular-arc models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconnaissance des graphes de cordes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Circle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong tree-cographs are Birkhoff graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure theorems for some circular-arc graphs / rank
 
Normal rank

Revision as of 13:54, 4 July 2024

scientific article
Language Label Description Also known as
English
Partial characterizations of circle graphs
scientific article

    Statements

    Partial characterizations of circle graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 October 2011
    0 references
    circle graphs
    0 references
    Helly circle graphs
    0 references
    linear domino graphs
    0 references
    \(P_{4}\)-tidy graphs
    0 references
    tree-cographs
    0 references
    unit circle graphs
    0 references

    Identifiers