Timeline for Can the Vertices of cubic graph be partitioned into and induced cycle and a forest?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 17, 2013 at 6:32 | comment | added | joro | @hbm to get the source, send me mail. the contact is on my user page. | |
| Dec 16, 2013 at 19:29 | comment | added | hbm | @joro: I am new to sage. Could be kind and post the a copy of the source code. Thx | |
| Dec 16, 2013 at 7:09 | comment | added | joro | @hbm For this I used sage for computations and the optional package nauty for generating cubic graphs. Both of them are free. Basically generated cubic graphs, iterated over the induced cycles (builtin func.) and checked for a forest. The code is short, fast and easy to write with basic knowledge of sage. Contact me if you want the source. | |
| Dec 15, 2013 at 20:33 | vote | accept | hbm | ||
| Dec 15, 2013 at 20:33 | comment | added | hbm | @joro thanks. I was wondering how you did your search. What software you are using? | |
| Dec 15, 2013 at 6:42 | comment | added | joro | @bof Thanks. In the several counterexamples found there are some vertex transitive. I stopped searching at order 16. | |
| Dec 15, 2013 at 6:39 | comment | added | bof | Nice example. (I mean the $3$-connected graph on $12$ vertices.) I haven't verified it, but it looks like it should work. To draw the graph neatly, draw a big circle around (not touching) a Star of David, and extend the lines in the star until they touch the circle, making six chords. The vertices of the graph are the points where the chords meet the circle. Of course the graph is Hamiltonian so it doesn't work for the other question. | |
| Dec 15, 2013 at 5:52 | history | edited | joro | CC BY-SA 3.0 |
3-connected counterexample
|
| Dec 14, 2013 at 7:08 | history | edited | joro | CC BY-SA 3.0 |
Tried to correct the answer with another counterexamples
|
| Dec 14, 2013 at 6:10 | history | answered | joro | CC BY-SA 3.0 |