Maxmaxflow and counting subgraphs.
The Electronic Journal of Combinatorics [electronic only] (2010)
- Volume: 17, Issue: 1, page Research Paper R99, 46 p., electronic only-Research Paper R99, 46 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topJackson, Bill, and Sokal, Alan D.. "Maxmaxflow and counting subgraphs.." The Electronic Journal of Combinatorics [electronic only] 17.1 (2010): Research Paper R99, 46 p., electronic only-Research Paper R99, 46 p., electronic only. <http://eudml.org/doc/226079>.
@article{Jackson2010,
author = {Jackson, Bill, Sokal, Alan D.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {graph; subgraph; flow; cocycle; maxmaxflow; maximum degree; secondlargest degree; degeneracy number; chromatic polynomial},
language = {eng},
number = {1},
pages = {Research Paper R99, 46 p., electronic only-Research Paper R99, 46 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Maxmaxflow and counting subgraphs.},
url = {http://eudml.org/doc/226079},
volume = {17},
year = {2010},
}
TY - JOUR
AU - Jackson, Bill
AU - Sokal, Alan D.
TI - Maxmaxflow and counting subgraphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2010
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 17
IS - 1
SP - Research Paper R99, 46 p., electronic only
EP - Research Paper R99, 46 p., electronic only
LA - eng
KW - graph; subgraph; flow; cocycle; maxmaxflow; maximum degree; secondlargest degree; degeneracy number; chromatic polynomial
UR - http://eudml.org/doc/226079
ER -
NotesEmbed ?
topYou 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.