$h$-perfect plane triangulations
Yohann Benchetrit, Henning Bruhn
TL;DR
This paper characterizes $h$-perfect plane triangulations through forbidden subgraphs and establishes that $h$-perfection coincides with perfection in plane triangulations.
Contribution
It provides a forbidden subgraph characterization of $h$-perfect plane triangulations and links $h$-perfection to the well-known concept of perfect graphs.
Findings
$h$-perfect plane triangulations are characterized by forbidden induced subgraphs.
A plane triangulation is $h$-perfect if and only if it is perfect.
The result simplifies the understanding of $h$-perfection in plane triangulations.
Abstract
We characterise -perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is -perfect if and only if it is perfect.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Computational Geometry and Mesh Generation