The reduced genus of a multigraph

Authors:
Patrice Ossona de Mendez
Affiliations:
CNRS UMR, E.H.E.S.S., Paris, France
Venue:
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Year:
1999

Citing 5
Cited 0

Every planar graph is 5-choosable

Journal of Combinatorial Theory Series B
A not 3-choosable planar graph without 3-cycles

Discrete Mathematics
On 3-colorable non-4-choosable planar graphs

Journal of Graph Theory
The four-colour theorem

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
A Flow Approach to Upward Drawings of Toroidal Maps

GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

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.