A new characterization of \(P_{6}\)-free graphs (Q972332): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.08.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2987461903 / rank
 
Normal rank

Revision as of 15:33, 19 March 2024

scientific article
Language Label Description Also known as
English
A new characterization of \(P_{6}\)-free graphs
scientific article

    Statements

    A new characterization of \(P_{6}\)-free graphs (English)
    0 references
    0 references
    0 references
    25 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    paths
    0 references
    cycles
    0 references
    induced subgraphs
    0 references
    complete bipartite graph
    0 references
    dominating set
    0 references
    computational complexity
    0 references
    0 references