L Volkmann
A proof of Favaron's conjecture and a disproof of Henning's conjecture on irredundance perfect graphs
Volkmann, L; Zverovich, Vadim
Citation
Volkmann, L., & Zverovich, V. (1997, May). A proof of Favaron's conjecture and a disproof of Henning's conjecture on irredundance perfect graphs. Paper presented at The 5th Twente Workshop on Graphs and Combinatorial Optimisation, Enschede, The Netherlands
Presentation Conference Type | Conference Paper (unpublished) |
---|---|
Conference Name | The 5th Twente Workshop on Graphs and Combinatorial Optimisation |
Conference Location | Enschede, The Netherlands |
Start Date | May 1, 1997 |
End Date | May 1, 1997 |
Publication Date | May 1, 1997 |
Peer Reviewed | Not Peer Reviewed |
Keywords | Favaron, Henning, perfect graphs |
Public URL | https://uwe-repository.worktribe.com/output/1102452 |
Additional Information | Title of Conference or Conference Proceedings : The 5th Twente Workshop on Graphs and Combinatorial Optimisation |
You might also like
Methods of Graph Decompositions
(2022)
Book
Modern Applications of Graph Theory
(2021)
Book
The likelihood of Braess' paradox in traffic networks
(2018)
Book Chapter