Chordal completions of planar graphs

DOI10.1006/jctb.1994.1056zbMath0809.05038OpenAlexW2090579013MaRDI QIDQ1333327

David Mumford, Fan R. K. Chung

Publication date: 20 March 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1994.1056

zbMATH Keywords

random graphsplanar graphgridchordal completionbounded genus

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Minimal triangulations of graphs: a survey, Demand-aware network designs of bounded degree, Wheel-Free Deletion Is W[2-Hard], Edge deletion to tree-like graph classes, Interval degree and bandwidth of a graph, On a wider class of prior distributions for graphical models, Algorithms for graphs with small octopus, Faster parameterized algorithms for \textsc{Minimum Fill-in}, Searching for better fill-in, Minimum fill-in of sparse graphs: kernelization and approximation, Minimum fill-in: inapproximability and almost tight lower bounds, Unnamed Item, A Network Design Problem with Two-Edge Matching Failures, A practical algorithm for making filled graphs minimal, Unnamed Item