The Reduced Genus of a Multigraph
Ossona De Mendez, Patrice
HAL, hal-00005638 / Harvested from HAL
Text on HAL
We define here the reduced genus of a multigraph as the minimum genus of a hypergraph having the same adjacencies with the same multiplicities. Through a study of embedded hypergraphs, we obtain new bounds on the coloring number, clique number and point arboricity of simple graphs of a given reduced genus. We present some new related problems on graph coloring and graph representation.
Publié le : 1999-07-05
Classification:  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 
@article{hal-00005638,
     author = {Ossona De Mendez, Patrice},
     title = {The Reduced Genus of a Multigraph},
     journal = {HAL},
     volume = {1999},
     number = {0},
     year = {1999},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00005638}
}

Ossona De Mendez, Patrice. The Reduced Genus of a Multigraph. HAL, Tome 1999 (1999) no. 0, . http://gdmltest.u-ga.fr/item/hal-00005638/