DeepAI AI Chat
Log In Sign Up

A local characterization for perfect plane near-triangulations

06/14/2019
by   Sameera M. Salam, et al.
NITC
0

We derive a local criterion for a plane near-triangulated graph to be perfect. It is shown that a plane near-triangulated graph is perfect if and only if it does not contain either a vertex, an edge or a triangle, the neighborhood of which has an odd hole as its boundary.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/11/2020

Rainbow Perfect and Near-Perfect Matchings in Complete Graphs with Edges Colored by Circular Distance

Given an edge-colored complete graph K_n on n vertices, a perfect (respe...
04/20/2022

Can Voters Detect Errors on Their Printed Ballots? Absolutely

There is still debate on whether voters can detect malicious changes in ...
11/09/2020

Total domination in plane triangulations

A total dominating set of a graph G=(V,E) is a subset D of V such that e...
12/11/2019

Ear-Slicing for Matchings in Hypergraphs

We study when a given edge of a factor-critical graph is contained in a ...
03/19/2023

Intersecting balls induced by a geometric graph II

For a graph whose vertices are points in ℝ^d, consider the closed balls ...