Old Web
English
Sign In
Acemap
>
Paper
>
Polyhedral Proof of a Characterization of Perfect Bidirected Graphs
Polyhedral Proof of a Characterization of Perfect Bidirected Graphs
2003
Yoshiko T. Ikebe
Akihisa Tamura
Keywords:
Discrete mathematics
Combinatorics
Mathematics
Indifference graph
Strong perfect graph theorem
Chordal graph
Graph
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]