Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

The Reduced Genus of a Multigraph

Patrice Ossona de MendezContact Information

(6)  CNRS UMR 0017, E.H.E.S.S., 54 Bd Raspail, 75006 Paris, France
Abstract
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.
This work was partially supported by the Esprit LTR Project no 20244-ALCOM IT

Contact Information Patrice Ossona de Mendez
Email: pom@ehess.fr
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.106 • Server: mpweb16
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)