Timeline for A Different 2-factor in a graph
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 28, 2015 at 20:20 | comment | added | Timothy Chow | I have posted the article on my website here. | |
| Oct 27, 2015 at 20:22 | history | edited | David Eppstein | CC BY-SA 3.0 |
added 126 characters in body
|
| Oct 27, 2015 at 20:18 | comment | added | Mohemnist | @TimothyChow It will be very helpful, if you scan the two pages and send it to me. You can send it to my username [at] gmail dot com. I also have a counterexample for the $\delta=3$ case. I've read in a survey that the 2-edge connectivity for the result of Jackson and Whitty is necessary. If I have access to these two pages I can confirm that. Thank you for your help. | |
| Oct 27, 2015 at 2:21 | comment | added | Timothy Chow | The first page does state the Theorem in question: Let $G$ be a 2-edge connected graph and $f:V(G)\to Z^+$. If $G$ has a unique $f$-factor, then some vertex $x$ of $G$ satisfies $d_G(x)=f(x)$. Fortunately, our library has a paper copy of the Jackson-Whitty paper, so I could scan the two missing pages if you need to see them. | |
| Oct 26, 2015 at 9:35 | comment | added | Mohemnist | I have access to Wiley Library, but unfortunately, pages 578 and 579 of this note are missing. This note has the total of 4 pages, so I have access to Page 1 and references!!!!!! | |
| Oct 26, 2015 at 6:33 | history | answered | David Eppstein | CC BY-SA 3.0 |