Abstract
Bidirected graphs which are generalizations of undirected graphs, have three types of edges: (+, +)-edges, (-, -)-edges and (+, -)-edges. Undirected graphs are regarded as bidirected graphs whose edges are all of type (+, +). The notion of perfection of undirected graphs can be naturally extended to bidirected graphs in terms of polytopes. The fact that a bidirected graph is perfect if and only if the undirected graph obtained by replacing all edges to (+, +) is perfect was independently proved by several researchers. This paper gives a polyhedral proof of the fact and introduces some new knowledge on perfect bidirected graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 1000-1007 |
| Number of pages | 8 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E86-A |
| Issue number | 5 |
| Publication status | Published - 2003 May |
| Externally published | Yes |
Keywords
- 0-1 Polytopes
- Bidirected graphs
- Degree-two inequalities
- Perfect graphs
ASJC Scopus subject areas
- Signal Processing
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
- Applied Mathematics