On k-trees with given leafages

MaRDI QIDQ5448017zbMATH OpenFDO

Authors Kensuke Hatanaka, Morimasa Tsuchiya

Publication date 20 March 2008

zbMATH Keywords

\(k\)-treeleafage

Mathematics Subject Classification ID

Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• \(k\)-separator chordal graphs: leafage and subfamilies
• The leafage of a chordal graph
• Leaf Powers and Their Properties: Using the Trees
• Polynomial-Time Algorithm for the Leafage of Chordal Graphs
• The vertex leafage of chordal graphs

Cited in

(10)

• On the structure and deficiency of k-trees with bounded degree
• \(k\)-separator chordal graphs: leafage and subfamilies
• The leafage of a chordal graph
• The Neighborhood Polynomial of Chordal Graphs
• On unavoidability of trees with k leaves
• Intersection representation of digraphs in trees with few leaves
• Some results related to the tenacity and existence of \(k\)-trees
• \(n\)-leaf and star \(n\)-leaf
• Vertex partitions of chordal graphs
• The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves.

This page was built for publication: On \(k\)-trees with given leafages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448017)