Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs (Q2840688): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.endm.2011.05.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995617289 / 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: On the structure of graphs with bounded asteroidal number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The leafage of a chordal graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:26, 6 July 2024

scientific article
Language Label Description Also known as
English
Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs
scientific article

    Statements

    Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs (English)
    0 references
    0 references
    23 July 2013
    0 references
    chordal graphs
    0 references
    clique separators
    0 references
    asteroidal number
    0 references
    leafage
    0 references

    Identifiers