Completely separable graphs (Q908944): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127976387, #quickstatements; #temporary_batch_1722203565125
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which claw-free graphs are perfectly orderable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing circle graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On brittle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127976387 / rank
 
Normal rank

Latest revision as of 22:54, 28 July 2024

scientific article
Language Label Description Also known as
English
Completely separable graphs
scientific article

    Statements

    Completely separable graphs (English)
    0 references
    0 references
    0 references
    1990
    0 references
    Boolean functions
    0 references
    separability
    0 references
    Completely separable graphs
    0 references
    liner time algorithms
    0 references
    recognition
    0 references
    optimization problems
    0 references
    maximum weighted stable set
    0 references
    maximum eighted clique
    0 references

    Identifiers

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