Clique trees of chordal graphs: leafage and 3-asteroidals

DOI10.1016/J.ENDM.2008.01.041MaRDI QIDQ3503559zbMATH OpenOpenAlexFDO

Authors M. Gutierrez, Silvia B. Tondato, Jayme L. Szwarcfiter

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2008.01.041

zbMATH Keywords

clique tree

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The leafage of a chordal graph
• scientific article; zbMATH DE number 554762
• On asteroidal sets in chordal graphs
• k-separator chordal graphs: leafage and subfamilies
• Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs

Cites work

• A characterisation of rigid circuit graphs
• Representation of a finite graph by a set of intervals on the real line
• Representations of chordal graphs as subtrees of a tree
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• The leafage of a chordal graph
• Topics in Intersection Graph Theory

Cited in

(6)

• Clique trees of infinite locally finite chordal graphs
• Characterization of classical graph classes by weighted clique graphs
• Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs
• Extended star graphs
• Reduced clique graphs of chordal graphs
• The leafage of a chordal graph

This page was built for publication: Clique trees of chordal graphs: leafage and 3-asteroidals

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