On algorithms for (\(P_5\), gem)-free graphs (Q817767): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q59567840, #quickstatements; #temporary_batch_1719331587082
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Andreas Brandstädt / rank
Normal rank
 
Property / author
 
Property / author: Jeremy P. Spinrad / rank
Normal rank
 
Property / author
 
Property / author: Andreas Brandstädt / rank
 
Normal rank
Property / author
 
Property / author: Jeremy P. Spinrad / 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.tcs.2005.09.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015452703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achromatic number is NP-complete for cographs and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the treewidth and the minimum fill-in with the modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of (\(P_{5}\),\,gem)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3676177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Practical Algorithms for Sequential Modular Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted parameters in \((P_5,\overline {P_5})\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivially perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized coloring for tree-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge dominating set and colorings on graphs with fixed clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel assignment and weighted coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-NLC graphs and polynomial algorithms / 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
Property / Wikidata QID
 
Property / Wikidata QID: Q59567840 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:09, 25 June 2024

scientific article
Language Label Description Also known as
English
On algorithms for (\(P_5\), gem)-free graphs
scientific article

    Statements

    On algorithms for (\(P_5\), gem)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 March 2006
    0 references
    (\(P_{5}\), gem)-free graphs
    0 references
    recognition algorithms
    0 references
    modular decomposition
    0 references
    independent set
    0 references
    clique
    0 references
    coloring
    0 references
    clique cover
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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