Even-hole-free graphs part II: Recognition algorithm (Q3150171): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59904351, #quickstatements; #temporary_batch_1710976035288
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the complexity of testing for odd holes and induced odd paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-cutsets and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced \(0,\pm 1\) matrices. I: Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part I: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even and odd holes in cap-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositions for perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\beta\)-perfect graphs / rank
 
Normal rank

Latest revision as of 16:35, 4 June 2024

scientific article
Language Label Description Also known as
English
Even-hole-free graphs part II: Recognition algorithm
scientific article

    Statements

    Even-hole-free graphs part II: Recognition algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 September 2002
    0 references
    even hole
    0 references
    decomposition
    0 references
    polytime algorithm
    0 references

    Identifiers