Algorithms on Subtree Filament Graphs (Q3655136): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4172077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in intersection graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree filament graphs are subtree overlap graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on maximal split-stable subgraphs / 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: Algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets and cliques in intersection graphs of filaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3D-interval-filament graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparability graphs and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination on Cocomparability Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138414 / rank
 
Normal rank

Latest revision as of 07:51, 2 July 2024

scientific article
Language Label Description Also known as
English
Algorithms on Subtree Filament Graphs
scientific article

    Statements

    Identifiers