Two characterisations of the minimal triangulations of permutation graphs (Q390311): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05A05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6249352 / rank
 
Normal rank
Property / zbMATH Keywords
 
permutation graphs
Property / zbMATH Keywords: permutation graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
interval graphs
Property / zbMATH Keywords: interval graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
minimal triangulations
Property / zbMATH Keywords: minimal triangulations / rank
 
Normal rank
Property / zbMATH Keywords
 
potential maximal cliques
Property / zbMATH Keywords: potential maximal cliques / rank
 
Normal rank
Property / zbMATH Keywords
 
characterisations
Property / zbMATH Keywords: characterisations / 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.disc.2013.06.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077491430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pathwidth and Treewidth of Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Minimum Fill-in: Grouping the Minimal Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing all potential maximal cliques of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Graphs and Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Induced Subgraphs via Minimal Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth on AT-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal triangulations of graphs: a survey / 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: On treewidth and minimum fill-in of asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of minimal triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and minimum fill-in on permutation graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating graphs without asteroidal triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and algorithmic applications of chordal graph embeddings / 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: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of chordal graphs as subtrees of a tree / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:03, 7 July 2024

scientific article
Language Label Description Also known as
English
Two characterisations of the minimal triangulations of permutation graphs
scientific article

    Statements

    Two characterisations of the minimal triangulations of permutation graphs (English)
    0 references
    0 references
    23 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    permutation graphs
    0 references
    interval graphs
    0 references
    minimal triangulations
    0 references
    potential maximal cliques
    0 references
    characterisations
    0 references
    0 references
    0 references
    0 references
    0 references