A local reductive elimination for the fill-in of graphs

DOI10.1016/0012-365X(94)00251-DzbMath0838.05069OpenAlexW2000962138MaRDI QIDQ1910534

Jinjiang Yuan

Publication date: 24 March 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00251-d

zbMATH Keywords

chordal graphlinear time algorithmfill-inHalin graphslocal reductive elimination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Matching theory
• Computing the Minimum Fill-In is NP-Complete
• Unnamed Item
• Unnamed Item

This page was built for publication: A local reductive elimination for the fill-in of graphs