Counting two-graphs related to trees.

Cameron, Peter J.

The Electronic Journal of Combinatorics [electronic only] (1995)

  • Volume: 2
  • ISSN: 1077-8926

How to cite

top

Cameron, Peter J.. "Counting two-graphs related to trees.." The Electronic Journal of Combinatorics [electronic only] 2 (1995): . <http://eudml.org/doc/118557>.

@article{Cameron1995,
author = {Cameron, Peter J.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {two-graphs; enumeration; trees},
language = {eng},
pages = {},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Counting two-graphs related to trees.},
url = {http://eudml.org/doc/118557},
volume = {2},
year = {1995},
}

TY - JOUR
AU - Cameron, Peter J.
TI - Counting two-graphs related to trees.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1995
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 2
SP -
LA - eng
KW - two-graphs; enumeration; trees
UR - http://eudml.org/doc/118557
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.