| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657344 | Journal of Combinatorial Theory, Series B | 2008 | 20 Pages |
Abstract
A graph is balanced if it is bipartite and every induced cycle has length divisible by four. In his book, Gérard Cornuéjols proposed a number of open questions, offering $5000 for the solution of any of them. Here we solve three of them, about balanced graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
