Characterizations of strongly chordal graphs (Q1051004): 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: Properties of (0,1)-matrices with no triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with no special cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / 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: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally-Balanced and Greedy Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:23, 14 June 2024

scientific article
Language Label Description Also known as
English
Characterizations of strongly chordal graphs
scientific article

    Statements

    Characterizations of strongly chordal graphs (English)
    0 references
    0 references
    1983
    0 references
    chordal graphs
    0 references
    forbidden induced subgraph characterization
    0 references
    totally balanced hypergraphs
    0 references
    polynomial algorithms
    0 references
    minimum weight domination
    0 references
    independent domination
    0 references

    Identifiers