login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126733 Number of connected graphs on n nodes with edge chromatic number 3. 0

%I #3 Mar 30 2012 16:50:37

%S 0,0,1,4,8,26,58,185,500,1677

%N Number of connected graphs on n nodes with edge chromatic number 3.

%H Keith M. Briggs, <a href="http://keithbriggs.info/cgt.html">Combinatorial Graph Theory</a>

%Y A diagonal of triangle in A126732.

%K nonn

%O 1,4

%A _N. J. A. Sloane_, Feb 16 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 26 04:18 EDT 2024. Contains 375454 sequences. (Running on oeis4.)