Evaluating a weighted graph polynomial for graphs of bounded tree-width.

Noble, S.D.

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

  • Volume: 16, Issue: 1, page Research Paper R64, 14 p.-Research Paper R64, 14 p.
  • ISSN: 1077-8926

How to cite

top

Noble, S.D.. "Evaluating a weighted graph polynomial for graphs of bounded tree-width.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper R64, 14 p.-Research Paper R64, 14 p.. <http://eudml.org/doc/117522>.

@article{Noble2009,
author = {Noble, S.D.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper R64, 14 p.-Research Paper R64, 14 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Evaluating a weighted graph polynomial for graphs of bounded tree-width.},
url = {http://eudml.org/doc/117522},
volume = {16},
year = {2009},
}

TY - JOUR
AU - Noble, S.D.
TI - Evaluating a weighted graph polynomial for graphs of bounded tree-width.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper R64, 14 p.
EP - Research Paper R64, 14 p.
LA - eng
UR - http://eudml.org/doc/117522
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.