Determining possible sets of leaves for spanning trees of dually chordal graphs.

MaRDI QIDQ2823194zbMATH OpenFDO

Authors Pablo De Caria, M. Gutierrez

Publication date 6 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

chordal graphclique treecompatible treedually chordal graphleafleafage

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Comparing trees characteristic to chordal and dually chordal graphs
• On the correspondence between tree representations of chordal and dually chordal graphs
• Doubly chordal graphs, steiner trees, and connected domination
• Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs
• Distance Approximating Trees for Chordal and Dually Chordal Graphs

Cited in

(4)

• Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs
• The vertex leafage of chordal graphs
• Polynomial-Time Algorithm for the Leafage of Chordal Graphs
• The Neighborhood Polynomial of Chordal Graphs

This page was built for publication: Determining possible sets of leaves for spanning trees of dually chordal graphs.

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