Simplicial powers of graphs (Q1040586): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.04.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990543619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique graphs and Helly graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood subtree tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dually Chordal 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: 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 note on the metric properties of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rebuilding convex sets in graphs / 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: Q4470503 / 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: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NeST graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / 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: Strictly chordal graphs are leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly Lexical Orderings of Matrices / 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: Q4792088 / rank
 
Normal rank

Latest revision as of 04:56, 2 July 2024

scientific article
Language Label Description Also known as
English
Simplicial powers of graphs
scientific article

    Statements

    Simplicial powers of graphs (English)
    0 references
    0 references
    0 references
    25 November 2009
    0 references
    graph powers
    0 references
    leaf powers
    0 references
    simplicial powers
    0 references
    forbidden induced subgraph
    0 references
    chordal graphs
    0 references
    block graphs
    0 references
    ptolemaic graphs
    0 references
    strongly chordal graphs
    0 references

    Identifiers