Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood subtree tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and linear time recognition of 3-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-Hereditary 5-Leaf Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and linear-time recognition of 4-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (k,ℓ)-Leaf Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-Steiner Root Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Phylogenetic Roots with Bounded Degrees and Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3808118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consecutive retrieval property -- revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error compensation in leaf power problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Clique-Width of Tree-Power and Leaf-Power Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of ptolemaic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strictly chordal graphs are leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks about leaf roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4032992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank

Latest revision as of 21:23, 27 June 2024

scientific article; zbMATH DE number 5263932
Language Label Description Also known as
English
Ptolemaic Graphs and Interval Graphs Are Leaf Powers
scientific article; zbMATH DE number 5263932

    Statements

    Ptolemaic Graphs and Interval Graphs Are Leaf Powers (English)
    0 references
    0 references
    0 references
    15 April 2008
    0 references
    leaf powers
    0 references
    leaf roots
    0 references
    strongly chordal graphs
    0 references
    ptolemaic graphs
    0 references
    graph powers
    0 references
    graph class inclusions
    0 references
    (unit) interval graphs
    0 references
    clique-width
    0 references

    Identifiers