A new characterization of \(P_{6}\)-free graphs (Q972332)

From MaRDI portal
Revision as of 21:16, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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