A Decomposition Theorem for Chordal Graphs and its Applications

DOI10.1016/j.endm.2009.07.093zbMath1273.05173OpenAlexW1970817390MaRDI QIDQ2851517

Juraj Stacho, Michel A. Habib

Publication date: 10 October 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.2009.07.093

zbMATH Keywords

chordal graphpolynomial timeasteroidal setleafagesplit-minor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (2)

Reduced clique graphs of chordal graphs ⋮ Characterization of classical graph classes by weighted clique graphs

Cites Work

• Polynomial-Time Algorithm for the Leafage of Chordal Graphs
• The leafage of a chordal graph
• Unnamed Item
• Unnamed Item

This page was built for publication: A Decomposition Theorem for Chordal Graphs and its Applications