Jump to content

trivially perfect graph (Q7844666)

From Wikidata
graph where every connected induced subgraph has a universal vertex
  • quasi-threshold graph
edit
Language Label Description Also known as
default for all languages
No label defined
    English
    trivially perfect graph
    graph where every connected induced subgraph has a universal vertex
    • quasi-threshold graph

    Statements

    subclass of
    cograph
    0 references
    permutation graph
    0 references
    Ptolemaic graph
    0 references
    interval graph
    0 references
    image
    Image
    Trivially perfect graph.svg
    505 × 356; 11 KB
    0 references
    studied by
    graph theory
    0 references

    Identifiers

    Freebase ID
    /m/047nvd0
    0 references
    graphclasses.org ID
    gc_1072
    subject named as
    NLCT-width 1
    0 references
    gc_346
    subject named as
    comparability graphs of arborescence orders
    0 references
    gc_347
    subject named as
    intersection graph of nested intervals
    0 references
    gc_327
    subject named as
    trivially perfect
    0 references
    gc_343
    subject named as
    (C4,P4)-free
    0 references
    gc_344
    subject named as
    chordal ∩ cograph
    0 references
    gc_345
    subject named as
    cograph ∩ interval
    0 references
    gc_781
    subject named as
    quasi-threshold
    0 references
     
    edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit
                    Retrieved from "https://www.wikidata.org/w/index.php?title=Q7844666&oldid=2401941757"