On feasible sets of mixed hypergraphs.
The Electronic Journal of Combinatorics [electronic only] (2004)
- Volume: 11, Issue: 1, page Research paper R19, 14 p.-Research paper R19, 14 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topKrál, Daniel. "On feasible sets of mixed hypergraphs.." The Electronic Journal of Combinatorics [electronic only] 11.1 (2004): Research paper R19, 14 p.-Research paper R19, 14 p.. <http://eudml.org/doc/124148>.
@article{Král2004,
author = {Král, Daniel},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {mixed hypergraph; coloring; feasible set},
language = {eng},
number = {1},
pages = {Research paper R19, 14 p.-Research paper R19, 14 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {On feasible sets of mixed hypergraphs.},
url = {http://eudml.org/doc/124148},
volume = {11},
year = {2004},
}
TY - JOUR
AU - Král, Daniel
TI - On feasible sets of mixed hypergraphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2004
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 11
IS - 1
SP - Research paper R19, 14 p.
EP - Research paper R19, 14 p.
LA - eng
KW - mixed hypergraph; coloring; feasible set
UR - http://eudml.org/doc/124148
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.