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.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)90539-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071801594 / rank
 
Normal rank

Latest revision as of 08:32, 30 July 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