Searching for "Jaeger's Conjecture." – sorted by Relevance.
-
Circular Chromatic Number of Planar Graphs of Large Odd Girth
- It was conjectured by Jaeger that 4k-edge connected graphs admit a (2k + 1; k)- ow. The restriction
- Cited by 8 (1 self) – Add To MetaCart
-
Planar graphs of odd-girth at least 9 are homomorphic to Petersen graph
- of Jaeger [2]. The following well-known conjecture was proposed by Jaeger [3]: Conjecture 1 (Circular
- Add To MetaCart
-
Matrix choosability
- ×n(F ) be such that perm(A) �= 0. Then A is 1-pliant. The following conjecture of Jaeger also concerns a solution
- Cited by 2 (0 self) – Add To MetaCart
-
Cut coloring and circuit covering
- - ffl for any 1 > ffl > 0 would still imply the following conjecture of Jaeger. Conjecture 1.9 (Jaeger
- Cited by 2 (0 self) – Add To MetaCart

