Triangulating multitolerance graphs (Q1392575): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem concerning tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite tolerance orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pathwidth and Treewidth of Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper and unit tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapezoid graphs and their coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some complexity properties of N-free posets and posets with bounded decomposition diameter / 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: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: TREEWIDTH OF CIRCLE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating graphs without asteroidal triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:28, 28 May 2024

scientific article
Language Label Description Also known as
English
Triangulating multitolerance graphs
scientific article

    Statements

    Triangulating multitolerance graphs (English)
    0 references
    0 references
    28 July 1998
    0 references
    tolerance graph
    0 references
    trapezoid graphs
    0 references
    multitolerance graph
    0 references
    fill-in problem
    0 references
    treewidth
    0 references
    pathwidth
    0 references

    Identifiers