Polyhedral Proof of a Characterization of Perfect Bidirected Graphs

Yoshiko T. Ikebe, Akihisa Tamura

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)1000-1007
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE86-A
Issue number5
Publication statusPublished - 2003 May
Externally publishedYes

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

Fingerprint Dive into the research topics of 'Polyhedral Proof of a Characterization of Perfect Bidirected Graphs'. Together they form a unique fingerprint.

  • Cite this