Intersection graphs of proper subtrees of unicyclic graphs (Q4309989): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A linear algorithm for the group path problem on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing claw-free perfect 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: Intersection graphs of concatenable subtrees of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(qn) algorithm to q-color a proper family of circular arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for fraternal orientation of graphs / rank
 
Normal rank

Latest revision as of 18:17, 22 May 2024

scientific article; zbMATH DE number 665814
Language Label Description Also known as
English
Intersection graphs of proper subtrees of unicyclic graphs
scientific article; zbMATH DE number 665814

    Statements

    Intersection graphs of proper subtrees of unicyclic graphs (English)
    0 references
    0 references
    27 November 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    acanthus
    0 references
    rooted tree
    0 references
    cycle
    0 references
    connected graph
    0 references
    intersection graph
    0 references
    concatenable edge subtrees
    0 references
    fraternal orientation
    0 references
    characterizations
    0 references
    polynomial algorithm
    0 references
    0 references