Bisplit graphs (Q2568470): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56288395, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable cutsets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some problems related to GRAPH 3-COLORABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable set bonding in perfect graphs and parity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(P_4\)-transversals of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with stable cutsets / rank
 
Normal rank

Latest revision as of 17:22, 10 June 2024

scientific article
Language Label Description Also known as
English
Bisplit graphs
scientific article

    Statements

    Bisplit graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2005
    0 references
    0 references
    split graphs
    0 references
    comparability graphs
    0 references
    induced subgraph characterization
    0 references
    0 references
    0 references