New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs (Q2404619): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Vertex elimination orderings for hereditary graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brambles and independent packings in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent packings in structured graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum independent set and maximum clique algorithms for overlap graphs / 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: The intersection graphs of subtrees in trees are exactly the chordal 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: Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALGORITHMS ON SUBGRAPH OVERLAP GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparability graphs and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and coloring polygon-circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thresholds for classes of intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138414 / rank
 
Normal rank

Latest revision as of 10:45, 14 July 2024

scientific article
Language Label Description Also known as
English
New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs
scientific article

    Statements

    New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs (English)
    0 references
    19 September 2017
    0 references
    graph algorithms
    0 references
    \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs
    0 references
    locally transitive graphs
    0 references
    maximum independent set
    0 references
    neighborhoods containment graphs
    0 references
    0 references

    Identifiers