<i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs (Q3476849): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1002/sapm198981179 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/sapm198981179 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W22831093 / 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: 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 / DOI
 
Property / DOI: 10.1002/SAPM198981179 / rank
 
Normal rank

Latest revision as of 11:17, 21 December 2024

scientific article
Language Label Description Also known as
English
<i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
scientific article

    Statements

    <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs (English)
    0 references
    1989
    0 references
    cographs
    0 references
    tree representation
    0 references
    computational complexity
    0 references

    Identifiers

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