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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Pim van 't Hof / rank
Normal rank
 
Property / author
 
Property / author: Pim van 't Hof / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Bipartite Subgraphs in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width for 4-vertex forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P<sub>6</sub>-FREE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for cograph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating subgraphs in graphs with some forbidden structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of \(P_{6}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Comparability Graph of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on "The Comparability Graph of a Tree" / rank
 
Normal rank

Latest revision as of 21:16, 2 July 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