A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs (Q1309452): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3899969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bull-free Berge graphs are perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge inducibility of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On brittle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3355252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3472122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime Testing for the Split Decomposition of a Graph / rank
 
Normal rank

Revision as of 11:01, 22 May 2024

scientific article
Language Label Description Also known as
English
A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
scientific article

    Statements

    A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs (English)
    0 references
    20 December 1993
    0 references
    house graph
    0 references
    decomposition
    0 references
    0 references

    Identifiers