Characterising \((k,\ell )\)-leaf powers (Q968117): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.09.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057773519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing a concept lattice by a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood subtree tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ptolemaic Graphs and Interval Graphs Are Leaf Powers / 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: Simplicial Powers of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A forbidden induced subgraph characterization of 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: On k- Versus (k + 1)-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: A note on the metric properties of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-Steiner Root Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3808118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error compensation in leaf power problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leaf Powers and Their Properties: Using the Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On metric properties of certain clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / 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: Linear-time recognition of circular-arc graphs / 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: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:41, 2 July 2024

scientific article
Language Label Description Also known as
English
Characterising \((k,\ell )\)-leaf powers
scientific article

    Statements

    Characterising \((k,\ell )\)-leaf powers (English)
    0 references
    0 references
    0 references
    5 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    \((k,\ell)\)-leaf powers
    0 references
    \(k\)-leaf powers
    0 references
    trees
    0 references
    block graphs
    0 references
    strictly chordal graphs
    0 references
    characterisations
    0 references
    recognition algorithms
    0 references
    0 references