Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs

DOI10.1016/j.endm.2011.05.015zbMath1268.05167OpenAlexW1995617289MaRDI QIDQ2840688

Liliana Alcón

Publication date: 23 July 2013

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

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

zbMATH Keywords

chordal graphsasteroidal numberclique separatorsleafage

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (1)

k-separator chordal graphs: leafage and subfamilies

Cites Work

• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representation of a finite graph by a set of intervals on the real line
• The leafage of a chordal graph
• On the structure of graphs with bounded asteroidal number

This page was built for publication: Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs