On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for dominating pairs in asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of cocomparability graphs and a new order-theoretic parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the bandwidth for asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating graphs without asteroidal triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to use the minimal separators of a graph for its chordal triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / 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: On Comparability and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank

Latest revision as of 12:23, 28 May 2024

scientific article
Language Label Description Also known as
English
On treewidth and minimum fill-in of asteroidal triple-free graphs
scientific article

    Statements

    On treewidth and minimum fill-in of asteroidal triple-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    23 July 1998
    0 references
    asteroidal triple-free graphs
    0 references

    Identifiers