A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3697033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3355252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of posets and the corresponding comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dacey Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental modular decomposition / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(95)00016-p / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038893115 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:58, 30 July 2024

scientific article
Language Label Description Also known as
English
A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
scientific article

    Statements

    A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (English)
    0 references
    0 references
    28 February 1997
    0 references
    \(P_ 4\)-reducible graphs
    0 references
    cographs
    0 references

    Identifiers