The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A305351 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A305351

Number of snarks with circular flow number 5 on 2n vertices.
(history; published version)

#12 by Michel Marcus at Sat Jun 03 09:29:55 EDT 2023

STATUS

reviewed

approved

#11 by Joerg Arndt at Sat Jun 03 09:02:21 EDT 2023

STATUS

proposed

reviewed

#10 by Pontus von Brömssen at Sat Jun 03 08:23:47 EDT 2023

STATUS

editing

proposed

#9 by Pontus von Brömssen at Sat Jun 03 08:20:11 EDT 2023

LINKS

House of Graphs, <a href="httphttps://hog.grinvinhouseofgraphs.org/Snarksmeta-directory/snarks">Snarks</a>

STATUS

approved

editing

#8 by R. J. Mathar at Mon Jun 25 14:11:25 EDT 2018

STATUS

proposed

approved

#7 by Michel Marcus at Thu May 31 10:26:20 EDT 2018

STATUS

editing

proposed

#6 by Michel Marcus at Thu May 31 10:26:10 EDT 2018

KEYWORD

nonn,more,changed

STATUS

proposed

editing

Discussion

Thu May 31

10:26

Michel Marcus: needed keyword more

#5 by Michel Marcus at Thu May 31 10:23:55 EDT 2018

STATUS

editing

proposed

#4 by Michel Marcus at Thu May 31 10:23:50 EDT 2018

REFERENCES

E. Máčajová and A. Raspaud, On the strong circular 5-flow conjecture, J. Graph Theory, 52 (2006), 307-316.

LINKS

J. Goedgebeur, D. Mattiolo and G. Mazzuoccolo, <a href="https://arxiv.org/abs/1804.00957">A unified approach to construct snarks with circular flow number 5</a>, arXiv:1804.00957 [math.CO] (2018).

E. Mácajová and A. Raspaud, <a href="https://doi.org/10.1002/jgt.20162">On the strong circular 5-flow conjecture</a>, J. Graph Theory, 52 (2006), 307-316.

STATUS

proposed

editing

#3 by Jan Goedgebeur at Thu May 31 07:38:06 EDT 2018

STATUS

editing

proposed